Document Open Access Logo

Beyond the Weakly Hard Model: Measuring the Performance Cost of Deadline Misses

Authors Paolo Pazzaglia, Luigi Pannocchi, Alessandro Biondi, Marco Di Natale

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2018.10.pdf
  • Filesize: 1.07 MB
  • 22 pages

Document Identifiers

Author Details

Paolo Pazzaglia
  • Scuola Superiore Sant'Anna, Pisa, Italy
Luigi Pannocchi
  • Scuola Superiore Sant'Anna, Pisa, Italy
Alessandro Biondi
  • Scuola Superiore Sant'Anna, Pisa, Italy
Marco Di Natale
  • Scuola Superiore Sant'Anna, Pisa, Italy

Cite As Get BibTex

Paolo Pazzaglia, Luigi Pannocchi, Alessandro Biondi, and Marco Di Natale. Beyond the Weakly Hard Model: Measuring the Performance Cost of Deadline Misses. In 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 106, pp. 10:1-10:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018) https://doi.org/10.4230/LIPIcs.ECRTS.2018.10

Abstract

Most works in schedulability analysis theory are based on the assumption that constraints on the performance of the application can be expressed by a very limited set of timing constraints (often simply hard deadlines) on a task model. This model is insufficient to represent a large number of systems in which deadlines can be missed, or in which late task responses affect the performance, but not the correctness of the application. For systems with a possible temporary overload, models like the m-K deadline have been proposed in the past. However, the m-K model has several limitations since it does not consider the state of the system and is largely unaware of the way in which the performance is affected by deadline misses (except for critical failures). In this paper, we present a state-based representation of the evolution of a system with respect to each deadline hit or miss event. Our representation is much more general (while hopefully concise enough) to represent the evolution in time of the performance of time-sensitive systems with possible time overloads. We provide the theoretical foundations for our model and also show an application to a simple system to give examples of the state representations and their use.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Embedded software
Keywords
  • control
  • real-time
  • cyber physical systems
  • weakly hard
  • deadline miss
  • performance

Metrics

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

Supplementary Materials

References

  1. Amir Aminifar, Petru Eles, Zebo Peng, and Anton Cervin. Control-quality driven design of cyber-physical systems with robustness guarantees. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 1093-1098. EDA Consortium, 2013. Google Scholar
  2. Amir Aminifar, Soheil Samii, Petru Eles, Zebo Peng, and Anton Cervin. Designing high-quality embedded control systems with guaranteed stability. In Real-Time Systems Symposium (RTSS), 2012 IEEE 33rd, pages 283-292, 2012. Google Scholar
  3. Karl-Erik Årzén, Anton Cervin, Johan Eker, and Lui Sha. An introduction to control and scheduling co-design. In Decision and Control, 2000. Proceedings of the 39th IEEE Conference on, volume 5, pages 4865-4870, 2000. Google Scholar
  4. Karl Johan Åström and Björn Wittenmark. Computer-controlled systems: theory and design. Prentice-Hall, 1997. Google Scholar
  5. Guillem Bernat, Alan Burns, and Albert Liamosi. Weakly hard real-time systems. IEEE transactions on Computers, 50(4):308-321, 2001. Google Scholar
  6. 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 Decision and Control (CDC), 2015 IEEE 54th Annual Conference on, pages 7510-7515. IEEE, 2015. Google Scholar
  7. Tobias Bund and Frank Slomka. Controller/platform co-design of networked control systems based on density functions. In Proceedings of the 4th ACM SIGBED International Workshop on Design, Modeling, and Evaluation of Cyber-Physical Systems, pages 11-14, 2014. Google Scholar
  8. Tobias Bund and Frank Slomka. Worst-case performance validation of safety-critical control systems with dropped samples. In Proceedings of the 23rd International Conference on Real Time and Networks Systems, pages 319-326, 2015. Google Scholar
  9. Benjamin Seth Cazzolato and Zebb Prime. On the dynamics of the furuta pendulum. Journal of Control Science and Engineering, 2011:3, 2011. Google Scholar
  10. A. Cervin, D. Henriksson, B. Lincoln, J. Eker, and K. E. Arzen. How does control timing affect performance? analysis and simulation of timing using jitterbug and truetime. IEEE Control Syst. Mag, 23 (3):16-30, 2003. Google Scholar
  11. F. Cremona, M. Morelli, and M. Di Natale. Tres: A modular representation of schedulers, tasks, and messages to control simulations in simulink. In Proceedings of the 30th Annual ACM Symposium on Applied Computing, pages 1940-1947. ACM, 2015. Google Scholar
  12. Goran Frehse, Arne Hamann, Sophie Quinton, and Matthias Woehrle. Formal analysis of timing effects on closed-loop properties of control software. In Real-Time Systems Symposium (RTSS), 2014 IEEE, pages 53-62. IEEE, 2014. Google Scholar
  13. Katsuhisa Furuta, Masaki Yamakita, and Seiichi Kobayashi. Swing up control of inverted pendulum. In Industrial Electronics, Control and Instrumentation, 1991. Proceedings. IECON'91., 1991 International Conference on, pages 2193-2198. IEEE, 1991. Google Scholar
  14. Madan Gopal. Digital control engineering. New Age International, 1988. Google Scholar
  15. Dip Goswami, Reinhard Schneider, and Samarjit Chakraborty. Co-design of cyber-physical systems via controllers with flexible delay constraints. In Proceedings of the 16th Asia and South Pacific Design Automation Conference, pages 225-230. IEEE Press, 2011. Google Scholar
  16. Zain AH Hammadeh, Sophie Quinton, and Rolf Ernst. Extending typical worst-case analysis using response-time dependencies to bound deadline misses. In Proceedings of the 14th International Conference on Embedded Software, page 10. ACM, 2014. Google Scholar
  17. Thomas A Henzinger, Benjamin Horowitz, and Christoph M Kirsch. Giotto: A time-triggered language for embedded programming. Proceedings of the IEEE, 91(1):84-99, 2003. Google Scholar
  18. Pavel Krcal and Wang Yi. Decidable and undecidable problems in schedulability analysis using timed automata. In proceedings of 10th International Conference, TACAS'04. IEEE, 2004. Google Scholar
  19. Steffen Linsenmayer and Frank Allgower. Stabilization of networked control systems with weakly hard real-time dropout description. In Decision and Control (CDC), 2017 IEEE 56th Annual Conference on, pages 4765-4770. IEEE, 2017. Google Scholar
  20. M. M Hamdaoui and P. Ramanathan. A dynamic priority assignment technique for streams with (m, k)-firm deadlines. In IEEE Transactions on Computers, 1995. Google Scholar
  21. Tsutomu Mita. Optimal digital feedback control systems counting computation time of control laws. In Decision and Control, 1984. The 23rd IEEE Conference on, volume 23, pages 520-525. IEEE, 1984. Google Scholar
  22. Marieke Posthumus-cloosterman, Cover Design, Gerda Cloosterman, and Paul Verspaget. Control over communication networks: Modelling, analysis and synthesis. PhD thesis, University of Eindhoven, 2008. Google Scholar
  23. Sophie Quinton, Matthias Hanke, and Rolf Ernst. Formal analysis of sporadic overload in real-time systems. In Proceedings of the Conference on Design, Automation and Test in Europe, pages 515-520. EDA Consortium, 2012. Google Scholar
  24. Parameswaran Ramanathan. Overload management in real-time control applications using (m, k)-firm guarantee. IEEE Transactions on Parallel and Distributed Systems, 10(6):549-559, 1999. Google Scholar
  25. Kang G Shin and Hagbae Kim. Derivation and application of hard deadlines for real-time control systems. IEEE Transactions on Systems, Man, and Cybernetics, 22(6):1403-1413, 1992. Google Scholar
  26. Damoon Soudbakhsh, Linh TX Phan, Anuradha M Annaswamy, and Oleg Sokolsky. Co-design of arbitrated network control systems with overrun strategies. IEEE Transactions on Control of Network Systems, 2016. Google Scholar
  27. Damoon Soudbakhsh, Linh TX Phan, Oleg Sokolsky, Insup Lee, and Anuradha Annaswamy. Co-design of control and platform with dropped signals. In Cyber-Physical Systems (ICCPS), 2013 ACM/IEEE International Conference on, pages 129-140, 2013. Google Scholar
  28. Martin Törngren. Fundamentals of implementing real-time control applications in distributed computer systems. In Real-Time Systems In Mechatronic Applications, pages 3-35. Springer, 1998. Google Scholar
  29. Eelco P van Horssen, AR Baghban Behrouzian, Dip Goswami, Duarte Antunes, Twan Basten, and WPMH Heemels. Performance analysis and controller improvement for linear systems with (m, k)-firm data losses. In Control Conference (ECC), 2016 European, pages 2571-2577. IEEE, 2016. Google Scholar
  30. Wenbo Xu, Zain AH Hammadeh, Alexander Kröller, Rolf Ernst, and Sophie Quinton. Improved deadline miss models for real-time systems using typical worst-case analysis. In Real-Time Systems (ECRTS), 2015 27th Euromicro Conference on, pages 247-256. IEEE, 2015. Google Scholar
  31. Yang Xu, Karl-Erik Årzén, Enrico Bini, and Anton Cervin. Response time driven design of control systems. IFAC Proceedings Volumes, 47(3):6098-6104, 2014. Google Scholar
  32. Yang Xu, Karl-Erik Årzén, Anton Cervin, Enrico Bini, and Bogdan Tanasa. Exploiting job response-time information in the co-design of real-time control systems. In Embedded and Real-Time Computing Systems and Applications (RTCSA), 2015 IEEE 21st International Conference on, pages 247-256, 2015. Google Scholar
  33. Tatsuya Yoshimoto and Toshimitsu Ushio. Optimal arbitration of control tasks by job skipping in cyber-physical systems. In Proceedings of the 2011 IEEE/ACM Second International Conference on Cyber-Physical Systems, pages 55-64. IEEE Computer Society, 2011. Google Scholar
  34. S. Youcheng and M. Di Natale. Weakly hard schedulability analysis for fixed priority scheduling of periodic real-time tasks. In EMSOFT Conference, Seoul, Korea. IEEE, October, 13-17, 2017. Google Scholar
  35. Qiang Yu and Xudong Zhao. Stability analysis of discrete-time switched linear systems with unstable subsystems. Applied Mathematics and Computation, 273:718-725, 2016. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact