The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50%
Ref: HURRAY-TR-060812 Publication Date: 2 to 4, Jul, 2003
The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50%
Ref: HURRAY-TR-060812 Publication Date: 2 to 4, Jul, 2003Abstract:
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
Download15th Euromicro Conference on Real-Time Systems (ECRTS'03), Euromicro, pp 33-40.
Porto, Portugal.
DOI:10.1109/EMRTS.2003.1212725.
ISBN: 0-7695-1936-9.
Record Date: 1, Mar, 2006
Other Versions:
The Utilization Bound of Static-Priority Preemptive Partitioned Multiprocessor Scheduling is 50% (Dec 1899)Journal of Embedded Computing
Short links for this page: www.cister.isep.pt/docs/10_1109_emrts_2003_1212725 www.cister.isep.pt/docs/hurray_tr_060812 www.cister.isep.pt/docs/260