The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50%
Ref: HURRAY-TR-110405 Publication Date: Apr 2011
The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50%
Ref: HURRAY-TR-110405 Publication Date: Apr 2011Abstract:
This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a
new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is
requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there
is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.
Björn AnderssonDocument:
View
DownloadPublished in Journal of Embedded Computing, IOS Press Amsterdam, Volume 4, Issue 2, pp 47-54.
Record Date: 1, Mar, 2006
Other Versions:
The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50% (30, Dec, 1899)15th Euromicro Conference on Real-Time Systems (ECRTS'03)
Short links for this page: www.cister.isep.pt/docs/hurray_tr_110405 www.cister.isep.pt/docs/965