Published Articles >> Table of Contents >> Abstract

International Parallel and Distributed Processing Symposium (IPDPS'03)   p. 114a
The Case for Fair Multiprocessor Scheduling
Anand Srinivasan, University of North Carolina at Chapel Hill
Philip Holman, University of North Carolina at Chapel Hill
James H. Anderson, University of North Carolina at Chapel Hill
Sanjoy Baruah, University of North Carolina at Chapel Hill

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213226
Send link to a friend

Abstract
In this paper, we compare the PD2 Pfair algorithm to the EDF-FF partitioning scheme, which uses "first fit" (FF) as a partitioning heuristic and the earliest-deadline-first (EDF) algorithm for per-processor scheduling. We present experimental results that show that PD2 is competitive with, and in some cases outperforms, EDF-FF. These results suggest that Pfair scheduling is a viable alternative to partitioning. Furthermore, as discussed herein, Pfair scheduling provides many additional benefits, such as simple and efficient synchronization, temporal isolation, fault tolerance, and support for dynamic tasks.
Back to Top Additional Information
Index Terms- Fair scheduling, multiprocessors, partitioning, Pfairness, real-time systems Citation:  Anand Srinivasan, Philip Holman, James H. Anderson, Sanjoy Baruah, "The Case for Fair Multiprocessor Scheduling," ipdps, p. 114a,  International Parallel and Distributed Processing Symposium (IPDPS'03),  2003