Abstract
Exact stochastic analysis of most real-time systems under preemptive priority-driven scheduling is unaffordable in current practice. Even assuming a periodic and independent task model, the exact calculation of the response time distribution of tasks is not possible except for simple task sets. Furthermore, in practice, tasks introduce complexities such as release jitter, blocking in shared resources, etc., which cannot be handled by the periodic independent task set model.
In order to solve these problems, exact analysis must be abandoned for an approximated analysis. However, in the real-time field, approximations must not be optimistic, i.e. the deadline miss ratios predicted by the approximated analysis must be greater than or equal to the exact ones. In order to achieve this goal, the concept of pessimism needs to be mathematically defined in the stochastic context, and the pessimistic properties of the analysis carefully derived.
This paper provides a mathematical framework for reasoning about stochastic pessimism, and obtaining mathematical properties of the analysis and its approximations. This framework allows us to prove the safety of several proposed approximations and extensions. We analyze and solve some practical problems in the implementation of the stochastic analysis, such as the problem of the finite precision arithmetic or the truncation of the probability functions. In addition, we extend the basic model in several ways, such as the inclusion of shared resources, release jitter or non-preemptive sections.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abeni L, Buttazzo G (2001) Stochastic analysis of a reservation based system. In: Proc of the 9th int workshop on parallel and distributed real-time systems, Apr 2001
Atlas AK, Bestavros A (1998) Statistical rate monotonic scheduling. In: Proc of the 19th IEEE real-time systems symposium, pp 123–132, Dec 1998
Audsley NC (1991) Optimal priority assignment and feasibility of static priority tasks with arbitrary start times. Technical report YCS 164, Dept Computer Science, University of York, Dec 1991
Baker TP (1991) Stack-based scheduling of realtime processes. Real-Time Syst 3(1)
Bernat G, Colin A, Petters S (2002) WCET analysis of probabilistic hard real-time systems. In: Proc of the 23rd IEEE real-time systems symposium, Dec 2002
Díaz JL, López JM (2007) Some notes on stochastic analysis using EDF scheduling. Technical report, Departamento de Informática, University of Oviedo. Also available at http://www.atc.uniovi.es/research/SNSAUES07.pdf
Díaz JL, García DF, Kim K, Lee C-G, Lo Bello L, López JM, Min SL, Mirabella O (2002) Stochastic analysis of periodic real-time systems in a real-time system. In: Proc of the 23rd IEEE real-time systems symposium, pp 289–300, Austin, Texas, Dec 2002
Díaz JL, López JM, García M, Campos AM, Kim K, Lo Bello L (2004) Pessimism in the stochastic analysis of real-time systems: concept and applications. In: Proc of the 25rd IEEE real-time systems symposium, Lisboa, Portugal, Dec 2004
Gardner MK (1999) Probabilistic analysis and scheduling of critical soft real-time systems. PhD thesis, University of Illinois, Urbana-Champaign
Gardner MK, Liu JWS (1999) Analyzing stochastic fixed-priority real-time systems. In: Proc of the 5th international conference on tools and algorithms for the construction and analysis of systems, Mar 1999
Kim K, Díaz JL, Lo Bello L, López JM, Lee CG, Min SL (2005) An exact stochastic analysis of priority-driven periodic real-time systems and its approximations. IEEE Trans Comput 54(11)
Lehoczky JP (1990) Fixed priority scheduling of periodic task sets with arbitrary deadlines. In: Proc of the 11th IEEE real-time systems symposium, pp 201–209, Dec 1990
Lehoczky JP (1996) Real-time queueing theory. In: Proc of the 17th IEEE real-time systems symposium, pp 186–195, Dec 1996
Lehoczky JP (1997) Real-time queueing network theory. In: Proc of the 18th IEEE real-time systems symposium, pp 58–67, Dec 1997
Levy H (1992) Stochastic dominance and expected utility: survey and analysis. Manag Sci 38(4):555–593. ISSN 0025-1909
Liu L, Layland J (1973) Scheduling algorithms for multiprogramming in a hard real-time environment. J ACM 20(1):46–61
Manolache S, Eles P, Peng Z (2007) Real-time applications with stochastic task execution times analysis and optimisation. Springer, PO Box 17, 3300 AA Dordrecht, The Netherlands. ISBN 978-1-4020-5509-6 (e-book)
Sha L, Rajkumar R, Lehoczky JP (1990) Priority inheritance protocols: an approach to real-time synchronization. IEEE Trans Comput 39(9):1175–1185
Tia T-S, Deng Z, Shankar M, Storch M, Sun J, Wu L-C, Liu JW-S (1995) Probabilistic performance guarantee for real-time tasks with varying computation times. In: Proc of the real-time technology and applications symposium, pp 164–173, Chicago, Illinois, May 1995
Tindell K, Burns A, Wellings AJ (1994) An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Syst 6:133–151
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
López, J.M., Díaz, J.L., Entrialgo, J. et al. Stochastic analysis of real-time systems under preemptive priority-driven scheduling. Real-Time Syst 40, 180–207 (2008). https://doi.org/10.1007/s11241-008-9053-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11241-008-9053-6