
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Deji Chen, Aloysius K. Mok, TeiWei Kuo, "Utilization Bound Revisited," IEEE Transactions on Computers, vol. 52, no. 3, pp. 351361, March, 2003.  
BibTex  x  
@article{ 10.1109/TC.2003.1183949, author = {Deji Chen and Aloysius K. Mok and TeiWei Kuo}, title = {Utilization Bound Revisited}, journal ={IEEE Transactions on Computers}, volume = {52}, number = {3}, issn = {00189340}, year = {2003}, pages = {351361}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2003.1183949}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Utilization Bound Revisited IS  3 SN  00189340 SP351 EP361 EPD  351361 A1  Deji Chen, A1  Aloysius K. Mok, A1  TeiWei Kuo, PY  2003 KW  Preemptive fixedpriority scheduling KW  ratemonotonic priority assignment KW  utilization bound. VL  52 JA  IEEE Transactions on Computers ER   
Abstract—Utilization bound is a wellknown concept introduced in the seminal paper of Liu and Layland, which provides a simple and practical way to test the schedulability of a realtime task set. The original utilization bound for the fixedpriority 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 PreEmptive Scheduling: A Historical Perspective,” RealTime Systems, vol. 8, pp. 173198, 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. 284292, Sept. 1993.
[3] A. Burchard, J. Liebeherr, Y. Oh, and S.H. Son, “Assigning RealTime Tasks to Homogeneous Multiprocessor Systems,” IEEE Trans. Computers, vol. 44, no. 12, pp. 14291442, Dec. 1995.
[4] A. Burns, K. Tindell, and A. Wellings, “Effective Analysis for Engineering RealTime Fixed Priority Schedulers,” IEEE Trans. Software Eng., vol. 21, no. 5, pp. 475480, May 1995.
[5] D. Chen, “RealTime 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 ReVisited,” Proc. Sixth Int'l Conf. RealTime Computing Systems and Applications, 1999.
[7] R. Devillers and J. Goossens, “Liu and Layland's Schedulability Test Revisited,” Information Processing Letters, vol. 73, nos. 56, pp. 157161, Mar. 2000.
[8] C.C. Han, “A Better PolynomialTime Scheduleability Test for RealTime Multiframe Tasks,” Proc. IEEE RealTime Systems Symp., Dec. 1998.
[9] C.C. Han, H.y. Tyan, “A Better PolynomialTime Schedulability Test for RealTime FixedPriority Scheduling Algorithms,” Proc. IEEE RealTime Systems Symp., pp. 3645, Dec. 1997.
[10] M. Joseph and P. Pandya, “Finding Response Times in a RealTime System,” The Computer J., vol. 29, no. 5, pp. 390395, Oct. 1986.
[11] M. Klein, T. Ralya, B. Pollak, R. Obenza, and M.G. Harbour, A Practitioner's Handbook for RealTime Analysis: Guide to Rate Monotonic Analysis for RealTime Systems. Boston: Kluwer Academic, 1993.
[12] T.W. Kuo and A.K. Mok, “Load Adjustment in Adaptive RealTime Systems,” Proc. IEEE RealTime 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. 511518, 1998.
[14] J.P. Lehoczky, “Fixed Priority Scheduling of Periodic Task Sets with Arbitrary Deadlines,” Proc. IEEE RealTime Systems Symp., Dec. 1990.
[15] J.Y.T. Leung and J. Whitehead, “On the Complexity of FixedPriority Scheduling of Periodic, RealTime Tasks,” Performance Evaluation, vol. 2, pp. 237250, 1982.
[16] C.L. Liu and J.W. Layland, “Scheduling Algorithms for Multiprogramming in a HardRealTime Environment,” J. ACM, vol. 20, no. 1, Jan. 1973.
[17] A.K. Mok and D. Chen, "A Multiframe Model for RealTime Tasks," Proc. IEEE RealTime System Symp., pp. 2229,Washington DC, Dec. 1996.
[18] D.W. Park, “A Generalized Utilization Bound Test for FixedPriority RealTime 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 FixedPriority RealTime Scheduling,” Proc. Second Int'l Workshop RealTime Computing Systems and Applications, pp. 7377, 1995.
[20] D.T. Peng and K.G. Shin, “A New Performance Measure for Scheduling Independent RealTime Tasks,” J. Parallel and Distributed Computing, vol. 19, pp. 1126, 1993.
[21] O. Serlin, “Scheduling of Time Critical Processes,” Spring Joint Computer Conf., vol. 41, pp. 925932, 1972.
[22] D. Shuzhen, X. Qiwen, and Z. Naijun, “A Formal Proof of the Rate Monotonic Scheduler,” RealTime Computing Systems and Applications, pp. 500503, 1998.
[23] M. Sjodin and H. Hansson, “Improved ResponseTime Analysis Calculations,” Proc. IEEE RealTime Systems Symp., pp. 3645, Dec. 1998.