Abstract | |
|
Back to Advance Program
The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%Björn Andersson and Jan JonssonTo appear at Euromicro Conference on Real-Time Systems (ECRTS03), Porto, Portugal, 2-4 July 2003
AbstractThis 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%.
10 Mar 2003 at 21:02:27 |