The Case for Fair Multiprocessor Scheduling

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Anand Srinivasan Articles by Philip Holman Articles by James H. Anderson Articles by Sanjoy Baruah

International Parallel and Distributed Processing Symposium (IPDPS'03)

Nice, France

April 22-April 26

ISBN: 0-7695-1926-1

	ASCII Text	x
	Anand Srinivasan, Philip Holman, James H. Anderson, Sanjoy Baruah, "The Case for Fair Multiprocessor Scheduling," Parallel and Distributed Processing Symposium, International, pp. 114a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003.

	BibTex	x
	@article{ 10.1109/IPDPS.2003.1213226, author = {Anand Srinivasan and Philip Holman and James H. Anderson and Sanjoy Baruah}, title = {The Case for Fair Multiprocessor Scheduling}, journal ={Parallel and Distributed Processing Symposium, International}, volume = {0}, year = {2003}, issn = {1530-2075}, pages = {114a}, doi = {http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213226}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Parallel and Distributed Processing Symposium, International TI - The Case for Fair Multiprocessor Scheduling SN - 1530-2075 SP EP A1 - Anand Srinivasan, A1 - Philip Holman, A1 - James H. Anderson, A1 - Sanjoy Baruah, PY - 2003 KW - Fair scheduling KW - multiprocessors KW - partitioning KW - Pfairness KW - real-time systems VL - 0 JA - Parallel and Distributed Processing Symposium, International ER -

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

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/IPDPS.2003.1213226

In this paper, we compare the PD² 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 PD² 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.

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, pp.114a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.