Optimal rate-based scheduling on multiprocessors

The PD2 Pfair/ERfair scheduling algorithm is the most efficient known algorithm for optimally scheduling periodic tasks on multiprocessors. In this paper, we prove that PD2 is also optimal for scheduling "rate-based" tasks whose processing steps may be highly jittered. The rate-based task model we consider generalizes the widely-studied sporadic task model.

• Type: Conference
• Year: 2002
• Where: STOC
• Authors: Anand Srinivasan, James H. Anderson
• Keywords: Algorithms, Efficient Known Algorithm, STOC 2002, Task Model, Widely-studied Sporadic Task