This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Utilization Bound Revisited
March 2003 (vol. 52 no. 3)
pp. 351-361
Tei-Wei Kuo, IEEE Computer Society

Abstract—Utilization bound is a well-known concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability of a real-time task set. The original utilization bound for the fixed-priority scheduler was given as a function of the number of tasks in the periodic task set. In this paper, we define the utilization bound as a function of the information about the task set. By making use of more than just the number of tasks, better utilization bound over the Liu and Layland bound can be achieved. We investigate in particular the bound given a set of periods for which it is still unknown if there is a polynomial algorithm for the exact bound. By investigating the relationships among the periods, we derive algorithms that yield better bounds than the Liu and Layland bound and the harmonic chain bound. Randomly generated task sets are tested against different bound algorithms. We also give a more intuitive proof of the harmonic chain bound and derive a computationally simpler algorithm.

[1] N.C. Audsley, A. Burns, R.I. Davis, K.W. Tindell, and A.J. Wellings, “Fixed Priority Pre-Emptive Scheduling: A Historical Perspective,” Real-Time Systems, vol. 8, pp. 173-198, 1995.
[2] N.C. Audsley, A. Burns, M. Richardson, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Eng. J. vol. 8, no. 5, pp. 284-292, Sept. 1993.
[3] A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, “Assigning Real-Time Tasks to Homogeneous Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1429-1442, Dec. 1995.
[4] A. Burns, K. Tindell, and A. Wellings, “Effective Analysis for Engineering Real-Time Fixed Priority Schedulers,” IEEE Trans. Software Eng., vol. 21, no. 5, pp. 475-480, May 1995.
[5] D. Chen, “Real-Time Data Management in the Distributed Environment,” PhD thesis, Univ. of Texas at Austin, 1999.
[6] D. Chen, A.K. Mok, and T.-W. Kuo, “Utilization Bound Re-Visited,” Proc. Sixth Int'l Conf. Real-Time Computing Systems and Applications, 1999.
[7] R. Devillers and J. Goossens, “Liu and Layland's Schedulability Test Revisited,” Information Processing Letters, vol. 73, nos. 5-6, pp. 157-161, Mar. 2000.
[8] C.-C. Han, “A Better Polynomial-Time Scheduleability Test for Real-Time Multiframe Tasks,” Proc. IEEE Real-Time Systems Symp., Dec. 1998.
[9] C.-C. Han, H.y. Tyan, “A Better Polynomial-Time Schedulability Test for Real-Time Fixed-Priority Scheduling Algorithms,” Proc. IEEE Real-Time Systems Symp., pp. 36-45, Dec. 1997.
[10] M. Joseph and P. Pandya, “Finding Response Times in a Real-Time System,” The Computer J., vol. 29, no. 5, pp. 390-395, Oct. 1986.
[11] M. Klein, T. Ralya, B. Pollak, R. Obenza, and M.G. Harbour, A Practitioner's Handbook for Real-Time Analysis: Guide to Rate Monotonic Analysis for Real-Time Systems. Boston: Kluwer Academic, 1993.
[12] T.-W. Kuo and A.K. Mok, “Load Adjustment in Adaptive Real-Time Systems,” Proc. IEEE Real-Time Systems Symp., Dec. 1991.
[13] S. Lauzac, R. Melhem, and D. Mosse, “An Efficient RMS Admission Control and Its Application to Multiprocessor Scheduling,” Proc. Int'l Parallel Processing Symp., pp. 511-518, 1998.
[14] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. IEEE Real-Time Systems Symp., Dec. 1990.
[15] 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.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” J. ACM, vol. 20, no. 1, Jan. 1973.
[17] A.K. Mok and D. Chen, "A Multiframe Model for Real-Time Tasks," Proc. IEEE Real-Time System Symp., pp. 22-29,Washington DC, Dec. 1996.
[18] D.-W. Park, “A Generalized Utilization Bound Test for Fixed-Priority Real-Time Scheduling,” PhD thesis, Texas A&M Univ.
[19] D.-W. Park, S. Natarajan, A. Kanevsky, and M.J. Kim, “A Generalized Utilization Bound Test for Fixed-Priority Real-Time Scheduling,” Proc. Second Int'l Workshop Real-Time Computing Systems and Applications, pp. 73-77, 1995.
[20] D.-T. Peng and K.G. Shin, “A New Performance Measure for Scheduling Independent Real-Time Tasks,” J. Parallel and Distributed Computing, vol. 19, pp. 11-26, 1993.
[21] O. Serlin, “Scheduling of Time Critical Processes,” Spring Joint Computer Conf., vol. 41, pp. 925-932, 1972.
[22] D. Shuzhen, X. Qiwen, and Z. Naijun, “A Formal Proof of the Rate Monotonic Scheduler,” Real-Time Computing Systems and Applications, pp. 500-503, 1998.
[23] M. Sjodin and H. Hansson, “Improved Response-Time Analysis Calculations,” Proc. IEEE Real-Time Systems Symp., pp. 36-45, Dec. 1998.

Index Terms:
Preemptive fixed-priority scheduling, rate-monotonic priority assignment, utilization bound.
Citation:
Deji Chen, Aloysius K. Mok, Tei-Wei Kuo, "Utilization Bound Revisited," IEEE Transactions on Computers, vol. 52, no. 3, pp. 351-361, March 2003, doi:10.1109/TC.2003.1183949
Usage of this product signifies your acceptance of the Terms of Use.