Budgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems

Authors Zain A. H. Hammadeh, Sophie Quinton, Marco Panunzio, Rafik Henia, Laurent Rioux, Rolf Ernst

Thumbnail PDF


  • Filesize: 0.56 MB
  • 22 pages

Document Identifiers

Author Details

Zain A. H. Hammadeh
Sophie Quinton
Marco Panunzio
Rafik Henia
Laurent Rioux
Rolf Ernst

Cite AsGet BibTex

Zain A. H. Hammadeh, Sophie Quinton, Marco Panunzio, Rafik Henia, Laurent Rioux, and Rolf Ernst. Budgeting Under-Specified Tasks for Weakly-Hard Real-Time Systems. In 29th Euromicro Conference on Real-Time Systems (ECRTS 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 76, pp. 17:1-17:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)


In this paper, we present an extension of slack analysis for budgeting in the design of weakly-hard real-time systems. During design, it often happens that some parts of a task set are fully specified while other parameters, e.g. regarding recovery or monitoring tasks, will be available only much later. In such cases, slack analysis can help anticipate how these missing parameters can influence the behavior of the whole system so that a resource budget can be allocated to them. It is, however, sufficient in many application contexts to budget these tasks in order to preserve weakly-hard rather than hard guarantees. We thus present an extension of slack analysis for deriving task budgets for systems with hard and weakly-hard requirements. This work is motivated by and validated on a realistic case study inspired by industrial practice.
  • Real-time
  • Weakly-hard
  • Slack analysis
  • Execution budget
  • Fixed priority


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads


  1. Guillem Bernat, Alan Burns, and Albert Llamosí. Weakly hard real-time systems. IEEE Trans. Comput., 50(4):308-321, April 2001. URL: http://dx.doi.org/10.1109/12.919277.
  2. Enrico Bini, Marco Di Natale, and Giorgio C. Buttazzo. Sensitivity analysis for fixed-priority real-time systems. In 18th Euromicro Conference on Real-Time Systems, ECRTS'06, 5-7 July 2006, Dresden, Germany, Proceedings, pages 13-22, 2006. URL: http://dx.doi.org/10.1109/ECRTS.2006.26.
  3. Rainer Blind and Frank Allgöwer. Towards networked control systems with guaranteed stability: Using weakly hard real-time constraints to model the loss process. In 54th IEEE Conference on Decision and Control, CDC 2015, Osaka, Japan, December 15-18, 2015, pages 7510-7515, 2015. URL: http://dx.doi.org/10.1109/CDC.2015.7403405.
  4. A. Burns, R. Davis, and S. Punnekkat. Feasibility analysis of fault-tolerant real-time task sets. In Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, pages 29-33, June 1996. URL: http://dx.doi.org/10.1109/EMWRTS.1996.557785.
  5. R. I. Davis, K. W. Tindell, and A. Burns. Scheduling slack time in fixed priority pre-emptive systems. In Real-Time Systems Symposium, 1993., Proceedings., pages 222-231, December 1993. URL: http://dx.doi.org/10.1109/REAL.1993.393496.
  6. Conrado Daws. Symbolic and parametric model checking of discrete-time markov chains. In Proceedings of the First International Conference on Theoretical Aspects of Computing, ICTAC'04, pages 280-294. Springer-Verlag, 2005. URL: http://dx.doi.org/10.1007/978-3-540-31862-0_21.
  7. P. Emberson, R. Stafford, and R. I. Davis. Techniques for the synthesis of multiprocessor tasksets. In 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems, pages 6-11, July 2010. Google Scholar
  8. Goran Frehse, Arne Hamann, Sophie Quinton, and Matthias Woehrle. Formal analysis of timing effects on closed-loop properties of control software. In Proceedings of the IEEE 35th IEEE Real-Time Systems Symposium, RTSS 2014, Rome, Italy, December 2-5, 2014, pages 53-62, December 2014. URL: http://dx.doi.org/10.1109/RTSS.2014.28.
  9. Thomas Hune, Judi Romijn, Mariëlle Stoelinga, and Frits Vaandrager. Linear parametric model checking of timed automata. The Journal of Logic and Algebraic Programming, 52:183-220, 2002. URL: http://dx.doi.org/10.1016/S1567-8326(02)00037-1.
  10. John P. Lehoczky. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In IEEE Real-Time Systems Symposium, pages 201-213, 1990. URL: http://dx.doi.org/
  11. J. P. Lehoczky and S. Ramos-Thuel. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Real-Time Systems Symposium, 1992, pages 110-123, December 1992. URL: http://dx.doi.org/10.1109/REAL.1992.242671.
  12. George Lima and Alan Burns. Scheduling fixed-priority hard real-time tasks in the presence of faults. In Proceedings of the Second Latin-American Conference on Dependable Computing, LADC'05, pages 154-173, 2005. URL: http://dx.doi.org/10.1007/11572329_14.
  13. C. L. Liu and James W. Layland. Scheduling algorithms for multiprogramming in a hard-real-time environment. J. ACM, 20(1):46-61, January 1973. URL: http://dx.doi.org/10.1145/321738.321743.
  14. Ma Maode and H. Babak. A fault-tolerant strategy for real-time task scheduling on multiprocessor system. In Parallel Architectures, Algorithms, and Networks, 1996. Proceedings., Second International Symposium on, pages 544-546, June 1996. URL: http://dx.doi.org/10.1109/ISPAN.1996.509038.
  15. Aloysius K. Mok and Deji Chen. A multiframe model for real-time tasks. IEEE Trans. Software Eng., 23(10):635-645, October 1997. URL: http://dx.doi.org/10.1109/32.637146.
  16. Moritz Neukirchner, Sophie Quinton, Tobias Michaels, Philip Axer, and Rolf Ernst. Sensitivity analysis for arbitrary activation patterns in real-time systems. In Proc. of Design Automation and Test in Europe (DATE), March 2013. URL: http://dx.doi.org/10.7873/DATE.2013.041,
  17. Sophie Quinton, Matthias Hanke, and Rolf Ernst. Formal analysis of sporadic overload in real-time systems. In DATE, pages 515-520, March 2012. URL: http://dx.doi.org/10.1109/DATE.2012.6176523.
  18. S. Ramos-Thuel and J. P. Lehoczky. On-line scheduling of hard deadline aperiodic tasks in fixed-priority systems. In Real-Time Systems Symposium, 1993., Proceedings., pages 160-171, December 1993. URL: http://dx.doi.org/10.1109/REAL.1993.393504.
  19. P. Rubel, M. Gillen, J. Loyall, R. Schantz, A. Gokhale, J. Balasubramanian, A. Paulos, and P. Narasimhan. Fault tolerant approaches for distributed real-time and embedded systems. In MILCOM 2007 - IEEE Military Communications Conference, pages 1-8, October 2007. URL: http://dx.doi.org/10.1109/MILCOM.2007.4455043.
  20. Too-Seng Tia, Jane W.-S. Liu, and Mallikarjun Shankar. Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems. Real-Time Systems, 10(1):23-43, 1996. URL: http://dx.doi.org/10.1007/BF00357882.
  21. Ken Tindell, Alan Burns, and Andy J. Wellings. An extendible approach for analyzing fixed priority hard real-time tasks. Real-Time Systems, 6(2):133-151, March 1994. URL: http://dx.doi.org/10.1007/BF01088593.
  22. Ernesto Wandeler and Lothar Thiele. Real-time interfaces for interface-based design of real-time systems with fixed priority scheduling. In Proceedings of the 5th ACM International Conference on Embedded Software, EMSOFT'05, pages 80-89, 2005. URL: http://dx.doi.org/10.1145/1086228.1086246.
  23. Wenbo Xu, Zain A. H. Hammadeh, Alexander Kröller, Sophie Quinton, and Rolf Ernst. Improved deadline miss models for real-time systems using typical worst-case analysis. In Proceedings of the 27th Euromicro Conference on Real-Time Systems, Lund, Sweden, July 2015. URL: http://dx.doi.org/10.1109/ECRTS.2015.29.