Abstract
The deadline-monotonic (DM) scheduling of sporadic task systems upon a preemptive uniprocessor is considered. A technique is derived for determining upper bounds on the response time of the jobs of each task, when a constrained-deadline sporadic task system is scheduled. This technique yields a generalization to a load-based sufficient schedulability condition for DM, the generalization being the added ability to account for blocking in the presence of non-preemptable serially re-usable resources.
Similar content being viewed by others
References
A Masrur SC, Farber G (2010) Constant-time admission control for deadline monotonic tasks. In: Proceedings of DATE: design, automation and test in Europe, Munich, Germany, March 2010, pp 220–225
Baruah S, Burns A (2006) Sustainable scheduling analysis. In: Proceedings of the IEEE real-time systems symposium, Rio de Janeiro, December 2006. IEEE Comput Soc, Los Alamitos, pp 159–168
Baruah S, Mok A, Rosier L (1990) Preemptively scheduling hard-real-time sporadic tasks on one processor. In: Proceedings of the 11th real-time systems symposium, Orlando, Florida, 1990. IEEE Comput Soc, Los Alamitos, pp 182–190
Bini E, Buttazzo G, Buttazzo G (2003) Rate monotonic scheduling: the hyperbolic bound. IEEE Trans Comput 52(7):933–942
Bini E, Nguyen TH, Richard P, Baruah S (2009) A response time bound in fixed-priority scheduling with arbitrary deadlines. IEEE Trans Comput 58(2):279–286
Buttazzo G (2005) Rate-monotonic vs. EDF: judgement day. Real-Time Syst, Int J Time-Crit Comput 29(1):5–26
Davis RI, Burns A (2008) Response time upper bounds for fixed priority real-time systems. In: Proceedings of the real-time systems symposium, December 2008. IEEE Comput Soc, Los Alamitos, pp 407–418
Davis R, Rothvoss T, Baruah S, Burns A (2009) Exact quantification of the sub-optimality of uniprocessor fixed priority pre-emptive scheduling. Real-Time Syst, Int J Time-Crit Comput 43(3):211–258
Eisenbrand F, Rothvoss T (2008) Static-priority real-time scheduling: response time computation is NP-hard. In: Proceedings of the real-time systems symposium, Barcelona, December 2008. IEEE Comput Soc, Los Alamitos
Fisher N (2007). The multiprocessor real-time scheduling of general task systems. PhD thesis, Department of Computer Science, The University of North Carolina at Chapel Hill
Fisher N, Baruah S (2005) A polynomial-time approximation scheme for feasibility analysis in static-priority systems with bounded relative deadlines. In: Proceedings of the 13th international conference on real-time systems, Paris, France, April 2005
Joseph M, Pandya P (1986) Finding response times in a real-time system. Comput J 29(5):390–395
Lehoczky J, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behavior. In: Proceedings of the real-time systems symposium—1989, Santa Monica, California, USA, Dec 1989. IEEE Comput Soc, Los Alamitos, pp 166–171
Leung J, Whitehead J (1982) On the complexity of fixed-priority scheduling of periodic, real-time tasks. Perform Eval 2:237–250
Liu JWS (2000) Real-time systems. Prentice-Hall, Upper Saddle River
Liu C, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46–61
Nguyen THC, Richard P, Bini E (2009) Approximation techniques for response-time analysis of static-priority tasks. Real-Time Syst 43(2):147–176
Stein S, Ivers M, Diemers J, Enrst R (2010) A polynomial time algorithm for computing response time bounds in static priority scheduling employing multi-linear workload bounds. In: Proceedings of the EuroMicro conference on real-time systems, Brussels, July 2010. IEEE Comput Soc, Los Alamitos, pp 261–270
Wellings A, Richardson M, Burns A, Audsley N, Tindell K (1993) Applying new scheduling theory to static priority pre-emptive scheduling. Softw Eng J 8:284–292
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Baruah, S. Efficient computation of response time bounds for preemptive uniprocessor deadline monotonic scheduling. Real-Time Syst 47, 517–533 (2011). https://doi.org/10.1007/s11241-011-9137-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-011-9137-6