Published Articles >> Table of Contents >> Abstract

15th Euromicro Conference on Real-Time Systems (ECRTS'03)   p. 33
The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%
Bjorn Andersson, Chalmers University of Technology
Jan Jonsson, Chalmers University of Technology

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/EMRTS.2003.1212725
Send link to a friend

Abstract
This paper studies preemptive static-priority scheduling on multiprocessors. We consider two approaches: global pfair static-priority scheduling and partitioned traditional static-priority scheduling. We prove that if presented algorithms are used and if less than 50% of the capacity is used then all deadlines are met. It is known that no static-priority multiprocessor scheduling algorithm can achieve a utilization bound greater than 50%.
Back to Top Additional Information
Citation:  Bjorn Andersson, Jan Jonsson, "The Utilization Bounds of Partitioned and Pfair Static-Priority Scheduling on Multiprocessors are 50%," ecrts, p. 33,  15th Euromicro Conference on Real-Time Systems (ECRTS'03),  2003