This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Rate-Monotonic Scheduling on Uniform Multiprocessors
July 2003 (vol. 52 no. 7)
pp. 966-970

Abstract—The rate-monotonic algorithm is arguably one of the most popular algorithms for scheduling systems of periodic real-time tasks. The rate-monotonic scheduling of systems of periodic tasks on uniform multiprocessor platforms is considered here. A simple, sufficient test is presented for determining whether a given periodic task system will be successfully scheduled by this algorithm upon a particular uniform multiprocessor platform—this test generalizes earlier results concerning rate-monotonic scheduling upon identical multiprocessor platforms.

[1] B. Andersson, S. Baruah, and J. Jonsson, Static-Priority Scheduling on Multiprocessors Proc. IEEE Real-Time Systems Symp., pp. 193-202, 2001.
[2] B. Andersson and J. Jonsson, Fixed-Priority Preemptive Multiprocessor Scheduling: To Partition or Not to Partition Proc. Int'l Conf. Real-Time Computing Systems and Applications, pp. 337-346, Dec. 2000.
[3] B. Andersson and J. Jonsson, Some Insights on Fixed-Priority Preemptive Non-Partitioned Multiprocessor Scheduling Proc. Real-Time Systems Symp. Work-In-Progress Session, Nov. 2000.
[4] N. Audsley,A. Burns,R. Davis,K. Tindell,, and A. Wellings,“Fixed priority scheduling: An historical perspective,” Real-Time Systems, vol. 8, no. 2/3, pp. 129-154, Mar. 1995.
[5] S. Baruah, Scheduling Periodic Tasks on Uniform Processors Proc. Euromicro Workshop Real-time Systems, pp. 7-14, June 2000.
[6] S. Davari and S.K. Dhall, On a Real-Time Task Allocation Problem Proc. 19th Hawaii Int'l Conf. System Science, Jan. 1985.
[7] S. Davari and S.K. Dhall, An On-Line Algorithm for Real-Time Tasks Allocation Proc. Real-Time Systems Symp., pp. 194-200, 1986.
[8] M. Dertouzos, Control Robotics: The Procedural Control of Physical Processors Proc. IFIP Congress, pp. 807-813, 1974.
[9] S.K. Dhall and C.L. Liu, On a Real-Time Scheduling Problem Operations Research, vol. 26, pp. 127-140, 1978.
[10] S. Funk, J. Goossens, and S. Baruah, On-Line Scheduling on Uniform Multiprocessors Proc. IEEE Real-Time Systems Symp., pp. 183-192, Dec. 2001.
[11] J. Leung and J. Whitehead, On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks Performance Evaluation, vol. 2, pp. 237-250, 1982.
[12] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,” J. ACM, vol. 20, no. 1, pp. 40-61, 1973.
[13] D.I. Oh and T.P. Baker, Utilization Bounds for N-Processor Rate Monotone Scheduling with Static Processor Assignment Real-Time Systems: The Int'l J. Time-Critical Computing, vol. 15, pp. 183-192, 1998.

Index Terms:
Uniform multiprocessors; periodic tasks; global scheduling; static priorities; rate-monotonic algorithm.
Citation:
Sanjoy K. Baruah, Jo? Goossens, "Rate-Monotonic Scheduling on Uniform Multiprocessors," IEEE Transactions on Computers, vol. 52, no. 7, pp. 966-970, July 2003, doi:10.1109/TC.2003.1214344
Usage of this product signifies your acceptance of the Terms of Use.