The utilization bounds of partitioned and pfair static-priority scheduling on multiprocessors are 50%

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%.

[1]  Sudarshan Kumar Dhall,et al.  Scheduling periodic-time - critical jobs on single processor and multiprocessor computing systems. , 1977 .

[2]  Sudarshan K. Dhall,et al.  An On Line Algorithm for Real-Time Tasks Allocation , 1986, IEEE Real-Time Systems Symposium.

[3]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[4]  Sang Hyuk Son,et al.  Allocating fixed-priority periodic tasks on multiprocessor systems , 1995, Real-Time Systems.

[5]  Sanjoy K. Baruah,et al.  Fairness in periodic real-time scheduling , 1995, Proceedings 16th IEEE Real-Time Systems Symposium.

[6]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[7]  Mathai Joseph,et al.  Finding Response Times in a Real-Time System , 1986, Comput. J..

[8]  Dong-Ik Oh,et al.  Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment , 1998, Real-Time Systems.

[9]  Campus de Viesques,et al.  Worst-Case Utilization Bound for EDF Scheduling on Real-Time Multiprocessor Systems , 2000 .

[10]  Daniel F. García,et al.  Minimum and maximum utilization bounds for multiprocessor RM scheduling , 2001, Proceedings 13th Euromicro Conference on Real-Time Systems.

[11]  Sang Hyuk Son,et al.  New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems , 1995, IEEE Trans. Computers.

[12]  Yingfeng Oh,et al.  Fixed-Priority Scheduling of Periodic Tasks on Multiprocessor Systems , 1995 .

[13]  Sanjoy K. Baruah,et al.  Static-priority scheduling on multiprocessors , 2001, Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).

[14]  Sanjoy K. Baruah,et al.  Proportionate progress: a notion of fairness in resource allocation , 1993, STOC '93.

[15]  Mark Moir,et al.  Static-priority periodic scheduling on multiprocessors , 2000, Proceedings 21st IEEE Real-Time Systems Symposium.

[16]  John P. Lehoczky,et al.  The rate monotonic scheduling algorithm: exact characterization and average case behavior , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[17]  Srikanth Ramamurthy,et al.  Scheduling periodic hard real-time tasks with arbitrary deadlines on multiprocessors , 2002, 23rd IEEE Real-Time Systems Symposium, 2002. RTSS 2002..

[18]  Rami G. Melhem,et al.  An efficient RMS admission control and its application to multiprocessor scheduling , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[19]  Joan Vila i Carbó,et al.  Using exact feasibility tests for allocating real-time tasks in multiprocessor systems , 1998, Proceeding. 10th EUROMICRO Workshop on Real-Time Systems (Cat. No.98EX168).