This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
December 1995 (vol. 44 no. 12)
pp. 1429-1442

Abstract—Optimal scheduling of real-time tasks on multiprocessor systems is known to be computationally intractable for large task sets. Any practical scheduling algorithm for assigning real-time tasks to a multiprocessor system presents a trade-off between its computational complexity and its performance. In this study, new schedulability conditions are presented for homogeneous multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The conditions are used to develop new strategies for assigning real-time tasks to processors. The performance of the new strategies is shown to be significantly better than suggested by the existing literature. Under the realistic assumption that the load of each real-time task is small compared to the processing speed of each processor, it is shown that the processors can be almost fully utilized.

[1] A. Burchard,Y. Oh,J. Liebeherr,, and S.H. Son,“A linear time online task assignment scheme for multiprocessor systems,” Proc. 11th IEEE Workshop Real-Time Operating Systems and Software, pp. 28-31, May 1994.
[2] S. Davari and S.K. Dhall,“An on line algorithm for real-time allocation,” 19th Ann. Hawaii Int’l Conf. System Sciences, pp. 133-141, 1986.
[3] S. Davari and S.K. Dhall,“An on line algorithm for real-time allocation,” IEEE Real-Time Systems Symp., pp. 194-200, 1986.
[4] S.K. Dhall,“Scheduling periodic-time-critical jobs on single processor and multiprocessor computing systems,” PhD thesis, Univ. of Illinois at Urbana-Champaign, 1977.
[5] S.K. Dhall and C.L. Liu,“On a real-time scheduling problem,” Operations Research, vol. 26, no. 1, pp. 127-140, Jan./Feb. 1978.
[6] D.S. Johnson,A. Demers,J.D. Ullman,M.R. Garey,, and R.L. Graham,“Worst case performance bounds for simple one-dimensional packing algorithms,” SIAM J. Computing, vol. 3, pp. 299-325, 1974.
[7] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE Real-Time Systems Symp., pp. 166-171, 1989.
[8] J.Y.-T. Leung and J. Whitehead,“On the complexity of fixed-priority scheduling of periodic real-time tasks,” Performance Evaluation, vol. 2, pp. 237-250, 1982.
[9] 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.
[10] Y. Oh and S.H. Son,“Tight performance bounds of heuristics for a real-time scheduling problem,” Technical Report CS-93-24, Univ. of Virginia, Dept. of Computer Science, May 1993.
[11] K. Ramamritham, J.A. Stankovic, and W. Zhao, “Distributed Scheduling of Tasks with Deadlines and Resource Requirements,” Trans. Computers, vol. 38, no. 8, Aug. 1989.
[12] L. Sha,J.P. Lehoczky,, and R. Rajkumar,“Solutions for some practical problems in prioritzed preemptive scheduling,” IEEE Real-Time Systems Symp., pp. 181-191, 1986.
[13] Hard Real-Time Systems, J.A. Stankovic and K. Ramamritham, eds. Los Alamitos, Calif.: IEEE CS Press, 1988.

Index Terms:
Hard real-time systems, multiprocessor systems, rate-monotonic scheduling, periodic tasks, task assignment scheme.
Citation:
Jörg Liebeherr, Almut Burchard, Yingfeng Oh, Sang H. Son, "New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems," IEEE Transactions on Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995, doi:10.1109/12.477248
Usage of this product signifies your acceptance of the Terms of Use.