Summary: Optimal Rate-based Scheduling on Multiprocessors
Anand Srinivasan and James H. Anderson
Department of Computer Science, University of North Carolina Chapel Hill, NC
Pfair/ERfair scheduling algorithm is the most
efficient known algorithm for optimally scheduling peri-
odic tasks on multiprocessors. In this paper, we prove
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.
In the real-time scheduling literature, the periodic 
and sporadic  task models have received the most
attention. In the periodic model, each task is invoked
repeatedly, with consecutive invocations, or jobs, be-
ing spaced apart by a fixed amount; in the sporadic
model, a lower bound on the time between invocations