Document Open Access Logo

Formal Comparison of Outgoing Event Streams Between Compositional Performance Analysis and Real-Time Calculus

Authors Victor Pollex , Frank Slomka

PDF

File

Thumbnail PDF
PDF
LIPIcs.ECRTS.2025.16.pdf
  • Filesize: 0.9 MB
  • 25 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Computer systems organization → Embedded and cyber-physical systems
Keywords
  • compositional performance analysis
  • real-time calculus
  • outgoing event streams

Metrics

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

Abstract

Real-time systems are required to produce correct responses which also need to be on time. Two methods to verify the timeliness of the results are the compositional performance analysis and the real-time calculus. Both methods use bounds as inputs from which they derive bounds for the timeliness. Therefore, it is preferable to have better bounds for the inputs. Any of these bounds may contain pessimism. Because both methods use a modular/compositional approach for distributed real-time systems, the pessimism in the bounds accumulate. Therefore, it is desirable to keep the pessimism as low as possible. In this work we investigate distributed real-time systems where tasks have an activation dependency, i. e., the activation of one task depends on the termination of a job of another task. Specifically, we compare the derived bound of how frequent the jobs of a task terminate and subsequently how frequent the activation dependent task activates and releases its jobs.
Our contribution is a formal comparison of these bounds that the compositional performance analysis and the real-time calculus derive by means of a mathematical proof. We show that for identical inputs the real-time calculus derives a bound that is not worse than the bound that the compositional performance analysis derives for a single module/component. The mathematical proof also removes any uncertainty that existing empirical comparisons of these bounds may contain.

Cite As Get BibTex

Victor Pollex and Frank Slomka. Formal Comparison of Outgoing Event Streams Between Compositional Performance Analysis and Real-Time Calculus. In 37th Euromicro Conference on Real-Time Systems (ECRTS 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 335, pp. 16:1-16:25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ECRTS.2025.16

Author Details

Victor Pollex
  • INCHRON AG, Erlangen, Germany
Frank Slomka
  • Institute of Embedded Systems/Real-Time Systems, Faculty of Engineering, Computer Science and Psychology, Ulm University, Germany

Funding

This work was supported by Federal Ministry of Education and Research under the grant agreement number 01IS21031.

References

  1. Anne Bouillard, Marc Boyer, and Euriell Le Corronc. Deterministic Network Calculus. John Wiley & Sons, Ltd, 2018. URL: https://doi.org/10.1002/9781119440284.
  2. Marc Boyer and Pierre Roux. A common framework embedding network calculus and event stream theory. Technical report, ONERA - The french aerospace lab, May 2016. Preprint. URL: https://hal.archives-ouvertes.fr/hal-01311502.
  3. Marc Boyer and Pierre Roux. Embedding network calculus and event stream theory in a common model. In 21st IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2016, Berlin, Germany, September 6-9, 2016, pages 1-8. IEEE, 2016. URL: https://doi.org/10.1109/ETFA.2016.7733565.
  4. Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation for Computer Science, 2nd Ed. Addison-Wesley, 1994. URL: https://www-cs-faculty.stanford.edu/%7Eknuth/gkp.html.
  5. Jean-Yves Le Boudec and Patrick Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet, volume 2050 of Lecture Notes in Computer Science. Springer, 2001. URL: https://doi.org/10.1007/3-540-45318-0.
  6. Martin Naedele, Lothar Thiele, and Michael Eisenring. Characterizing Variable Task Releases and Processor Capacities. Technical report, ETH Zürich, 1999. URL: https://doi.org/10.3929/ethz-a-004289034.
  7. Simon Perathoner, Ernesto Wandeler, Lothar Thiele, Arne Hamann, Simon Schliecker, Rafik Henia, Razvan Racu, Rolf Ernst, and Michael González Harbour. Influence of Different System Abstractions on the Performance Analysis of Distributed Real-Time Systems. In Christoph M. Kirsch and Reinhard Wilhelm, editors, Proceedings of the 7th ACM & IEEE International conference on Embedded software, EMSOFT 2007, September 30 - October 3, 2007, Salzburg, Austria, pages 193-202. ACM, 2007. URL: https://doi.org/10.1145/1289927.1289959.
  8. Victor Pollex, Steffen Kollmann, and Frank Slomka. Generalizing Response-Time Analysis. In 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2010, Macau, SAR, China, 23-25 August 2010, pages 203-211. IEEE Computer Society, 2010. URL: https://doi.org/10.1109/RTCSA.2010.36.
  9. Victor Pollex and Frank Slomka. A Mathematical Comparison Between Response-Time Analysis and Real-Time Calculus for Fixed-Priority Preemptive Scheduling. In Martina Maggio, editor, 34th Euromicro Conference on Real-Time Systems (ECRTS 2022), volume 231 of Leibniz International Proceedings in Informatics (LIPIcs), pages 7:1-7:25, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2022.7.
  10. Kai Richter. Compositional Scheduling Analysis Using Standard Event Models. PhD thesis, Technical University Carolo-Wilhemina of Braunschweig, 2005. URL: https://doi.org/10.24355/dbbs.084-200511080100-362.
  11. Pierre Roux, Sophie Quinton, and Marc Boyer. A Formal Link Between Response Time Analysis and Network Calculus. In Martina Maggio, editor, 34th Euromicro Conference on Real-Time Systems (ECRTS 2022), volume 231 of Leibniz International Proceedings in Informatics (LIPIcs), pages 5:1-5:22, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2022.5.
  12. Simon Schliecker. Performance Analysis of Multiprocessor Real-Time Systems with Shared Resources. PhD thesis, Technical University Carolo-Wilhemina of Braunschweig, 2011. URL: https://doi.org/10.24355/dbbs.084-201111210932-0.
  13. Frank Slomka and Mohammadreza Sadeghi. HeRTA: Heaviside Real-Time Analysis, 2020. Preprint. URL: https://doi.org/10.48550/arXiv.2007.12112.
  14. Frank Slomka and Mohammadreza Sadeghi. Beyond the limitations of real-time scheduling theory: a unified scheduling theory for the analysis of real-time systems. SICS Software-Intensive Cyber Physical Systems, 35(3-4):201-236, 2021. URL: https://doi.org/10.1007/s00450-021-00429-1.
  15. Frank Slomka and Mohammadreza Sadeghi. Work-in-Progress Abstract: On the relationship between scheduling theory and real-time calculus. In 27th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2021, Houston, TX, USA, August 18-20, 2021, pages 195-197. IEEE, 2021. URL: https://doi.org/10.1109/RTCSA52859.2021.00030.
  16. Ken W. 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: https://doi.org/10.1007/BF01088593.
  17. Ernesto Wandeler. Modular Performance Analysis and Interface-Based Design for Embedded Real-Time Systems. PhD thesis, Swiss Federal Institute of Technology Zurich, 2006. URL: https://doi.org/10.3929/ethz-a-005328667.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

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