
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Tarek F. Abdelzaher, Vivek Sharma, Chenyang Lu, "A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling," IEEE Transactions on Computers, vol. 53, no. 3, pp. 334350, March, 2004.  
BibTex  x  
@article{ 10.1109/TC.2004.1261839, author = {Tarek F. Abdelzaher and Vivek Sharma and Chenyang Lu}, title = {A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling}, journal ={IEEE Transactions on Computers}, volume = {53}, number = {3}, issn = {00189340}, year = {2004}, pages = {334350}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.2004.1261839}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling IS  3 SN  00189340 SP334 EP350 EPD  334350 A1  Tarek F. Abdelzaher, A1  Vivek Sharma, A1  Chenyang Lu, PY  2004 KW  Realtime scheduling KW  schedulability analysis KW  utilization bounds KW  aperiodic tasks. VL  53 JA  IEEE Transactions on Computers ER   
Abstract—Realtime scheduling theory offers constanttime schedulability tests for periodic and sporadic tasks based on utilization bounds. Unfortunately, the periodicity or the minimal interarrivaltime assumptions underlying these bounds make them inapplicable to a vast range of aperiodic workloads such as those seen by network routers, Web servers, and eventdriven systems. This paper makes several important contributions toward realtime scheduling theory and schedulability analysis. We derive the first known bound for schedulability of
[1] T. Abdelzaher and C. Lu, Schedulability Analysis and Utilization Bounds for Highly Scalable RealTime Services Proc. IEEE RealTime Technology and Applications Symp., June 2001.
[2] T.F. Abdelzaher, K.G. Shin, and N. Bhatti, Performance Guarantees for Web Server EndSystems: A ControlTheoretical Approach IEEE Trans. Parallel and Distributed Systems, 2001.
[3] K.G. Shin and Y.C. Chang, “A ReservationBased Algorithm for Scheduling Both Periodic and Aperiodic RealTime Tasks,” IEEE Trans. Computers, vol. 44, no. 12, pp. 1,4051,419, Dec. 1995.
[4] D. Chen, A.K. Mok, and T.W. Kuo, “Utilization Bound ReVisited,” Proc. Sixth Int'l Conf. RealTime Computing Systems and Applications, 1999.
[5] R. Davis and A. Burns, Optimal Priority Assignment for Aperiodic Tasks with Firm Deadlines in Fixed Priority PreEmptive Systems Information Processing Letters, vol. 53, no. 5, pp. 249254, Mar. 1995.
[6] R. Devillers and J. Goossens, Liu and Layland's Schedulability Test Revisited Information Processing Letters, vol. 73, no. 5, pp. 157161, Mar. 2000.
[7] N. Gandhi, S. Parekh, J. Hellerstein, and D. Tilbury, Feedback Control of a Lotus Notes Server: Modeling and Control Design Proc. Am. Control Conf., 2001.
[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] G. Koren and D. Shasha, “DOver: An Optimal OnLine Scheduling Algorithm for Overloaded RealTime Systems,” Proc. IEEE RealTime Systems Symp., pp. 290299, Dec. 1992.
[11] T.W. Kuo and A.K. Mok, “Load Adjustment in Adaptive RealTime Systems,” Proc. IEEE RealTime Systems Symp., Dec. 1991.
[12] 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.
[13] J. Lehoczky, L. Sha, and Y. Ding, The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior Proc. IEEE RealTime Systems Symp., pp. 166171, 1989.
[14] J.P. Lehoczky and S. RamosThuel, “An Optimal Algorithm for Scheduling SoftAperiodic Tasks in FixedPriority Preemptive Systems,” Proc. RealTime Systems Symp., pp. 110123, 1992.
[15] J.P. Lehoczky, RealTime Queueing Theory Proc. 17th IEEE RealTime Systems Symp. (RSS '96), pp. 186195, Dec. 1996.
[16] J.P. Lehoczky, Using RealTime Queueing Theory to Control Lateness in RealTime Systems Proc. 1997 ACM SIGMETRICS Int'l Conf. Measurement and Modeling of Computer Systems, Performance Evaluation Rev., vol. 25, no. 1, pp. 158168, June 1997.
[17] T.H. Lin and W. Tarng, Scheduling Periodic and Aperiodic Tasks in Hard RealTime Computing Systems Performance Evaluation Rev., vol. 19, no. 1, May 1991.
[18] C.L. Liu and J.W. Layland, Scheduling Algorithms for Multiprogramming in a HardRealTime Environment J. ACM, vol. 20, no. 1, pp. 4661, 1973.
[19] J.M. López, J.L. Díaz, M. García, and D.F. García, WorstCase Utilization Bound for EDF Scheduling on RealTime Multiprocessor Systems Proc. Euromicro Conf. RealTime Systems, pp. 2533, 2000.
[20] C. Lu, T. Abdelzaher, J. Stankovic, and S. Son, A Feedback Control Approach for Guaranteeing Relative Delays in Web Servers Proc. IEEE RealTime Technology and Applications Symp., June 2001.
[21] Y. Lu, A. Saxena, and T.F. Abdelzaher, Differentiated Caching Services; a ControlTheoretical Approach Proc. Int'l Conf. Distributed Computing System, Apr. 2001.
[22] A.K. Mok and D. Chen, “A Multiframe Model for RealTime Tasks,” IEEE Trans. Software Eng., vol. 23, no. 10, pp. 635645, Oct. 1997.
[23] M. DiNatale and J. Stankovic, Dynamic EndtoEnd Guarantees in Distributed RealTime Systems Proc. RealTime Systems Symp., pp. 216227, Dec. 1994.
[24] D.I. Oh and T.P.B. TP, Utilization Bounds for nProcessor Rate Monotone Scheduling with Static Processor Assignment RealTime Systems, vol. 15, no. 2, 1998.
[25] M. Pandya and M. Malek, “Minimum Achievable Utilization for FaultTolerant Processing of Periodic Tasks,” IEEE Trans. Computers, vol. 47, no. 10, pp. 11021112, Oct. 1998.
[26] D.W. Park, S. Natarajan, and A. Kanevsky, FixedPriority Scheduling of RealTime Systems Using Utilization Bounds J. Systems and Software, vol. 33, no. 1, pp. 5763, Apr. 1996.
[27] 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.
[28] I. Bhandari, M. Halliday, E. Tarver, D. Brown, J. Chaar, and R. Chillarege, "A Case Study of Software Process Improvement During Development," IEEE Trans. Software Eng., vol. 19, no. 12, pp. 1,1571,170, Dec. 1993.
[29] B. Sprunt, L. Sha, and J. Lehoczky, Aperiodic Task Scheduling for HardRealTime Systems RealTime Systems, vol. 1, no. 1, pp. 2760, June 1989.
[30] J.A. Stankovic, “Decentralized Decision Making for Tasks Reallocation in a Hard RealTime System,” IEEE Trans. Computers, vol. 38, no. 3, pp. 341355, Mar. 1989.
[31] J. Stankovic and K. Ramamritham, Hard RealTime Systems. IEEE Press, 1988.
[32] J.A. Stankovic and K. Ramamritham, The Design of the Spring Kernel Proc. RealTime Systems Symp., pp. 146157, Dec. 1987.
[33] J.A. Stankovic and K. Ramamritham, “The Spring Kernel: A New Paradigm for RealTime Systems,” IEEE Software, pp. 6272, May 1991.
[34] J.A. Stankovic, K. Ramamritham, and S. Cheng, Evaluation of a Flexible Task Scheduling Algorithm for Distributed Hard RealTime Systems IEEE Trans. Computers, vol. 34, no. 12, pp. 11301143, Dec. 1985.
[35] D.C. Steere, A. Goel, J. Gruenberg, D. McNamee, C. Pu, and J. Walpole, A FeedbackDriven Proportion Allocator for RealRate Scheduling Operating Systems Design and Implementation, 1999.
[36] J.K. Strosnider, J.P. Lehoczky, and L. Sha, “The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard RealTime Environments,” IEEE Trans. Computers, vol. 44, no. 1, Jan. 1995.
[37] S.R. Thuel and J.P. Lehoczky, Algorithms for Scheduling Hard Aperiodic Tasks in FixedPriority Systems Using Slack Stealing Proc. RealTime Systems Symp., pp. 2233, Dec. 1994.
[38] O. Yingfeng and S.H. Son, Allocating FixedPriority Periodic Tasks on Multiprocessor Systems RealTime Systems, vol. 9, no. 3, pp. 207239, Nov. 1995.
[39] W. Zhao, K. Ramamritham, and J. Stankovic, Preemptive Scheduling under Time and Resource Constraints IEEE Trans. Computers, vol. 36, no. 8, pp. 949960, Aug. 1987.
[40] W. Zhao, K. Ramamritham, and J. Stankovic, Scheduling Tasks with Resource Requirements in Hard RealTime Systems IEEE Trans. Software Eng., vol. 13, no. 5, pp. 564577, May 1987.