Open AccessOptimal rate-based scheduling on multiprocessors
Author(s) -
Anand Srinivasan,
James H. Anderson
Publication year - 2002
Publication title -
carolina digital repository (university of north carolina at chapel hill)
Language(s) - English
Resource type - Conference proceedings
DOI - 10.1145/509907.509938
Subject(s) - computer science , parallel computing , scheduling (production processes) , fair share scheduling , dynamic priority scheduling , processor scheduling , fixed priority pre emptive scheduling , rate monotonic scheduling , distributed computing , mathematical optimization , computer network , mathematics , resource (disambiguation) , quality of service
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom