We consider a multiprocessor where hard real-time tasks are scheduled globally on in processors. Each task has a fixed priority and tasks are executed using preemptive scheduling. The state-of-the-art priority assignment scheme in such cases is called RM-US[US-LIMIT], where US-LIMIT is a parameter to the RM-US algorithm. The challenge is to find the US-LIMIT that can guarantee schedulability for as high utilization as possible. The previously best known US-LIMIT value could guarantee schedulability as long as the multiprocessor utilization is below m/(3m-2), i.e. 0.33333 when m/spl rarr//spl infin/. In this paper we define a new equation for US-LIMIT which guarantees schedulability for higher utilization values than the previous result. When m/spl rarr//spl infin/ we can now guarantee schedulability, for all tasks sets when the multiprocessor utilization is below 0.37482. We also show that our US-LIMIT values are optimal, i.e. we show that there is no room for further improvement of this state-of-the-art priority assignment scheme.
[1]
Sanjoy K. Baruah,et al.
Static-priority scheduling on multiprocessors
,
2001,
Proceedings 22nd IEEE Real-Time Systems Symposium (RTSS 2001) (Cat. No.01PR1420).
[2]
Jan Åke Jönsson,et al.
Some Insights on Fixed-Priority Preemptive Non-Partitioned Multiprocessor Scheduling
,
2000,
RTSS 2000.
[3]
Sudarshan K. Dhall,et al.
On a Real-Time Scheduling Problem
,
1978,
Oper. Res..
[4]
Chung Laung Liu,et al.
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
,
1989,
JACM.
[5]
Joseph Y.-T. Leung,et al.
On the complexity of fixed-priority scheduling of periodic, real-time tasks
,
1982,
Perform. Evaluation.
[6]
Greger Ottosson,et al.
Worst-case execution time analysis for modern hardware architectures
,
1997
.