Document Open Access Logo

Multi-Core Integration of Sporadic Events in Time-Triggered Systems

Authors Anaïs Finzi , Silviu S. Craciunas

PDF

File

Thumbnail PDF
PDF
LIPIcs.ECRTS.2026.20.pdf
  • Filesize: 2.72 MB
  • 23 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computer systems organization → Dependable and fault-tolerant systems and networks
Keywords
  • time-triggered (TT)
  • event-triggered (ET)
  • scheduling
  • real-time
  • real-time calculus
  • response-time analysis

Metrics

Abstract

Modern safety-critical systems often feature multi-core multi-SoC platforms and execute both periodic and sporadic workloads with real-time requirements. Periodic tasks benefit from a time-triggered (TT) approach, while sporadic events are best modeled by event-triggered (ET) tasks and scheduled using classical online mechanisms such as fixed-priority. Integrating TT and ET tasks in a multi-core environment has mainly been studied in fully partitioned solutions. However, for certain workloads, it may be beneficial to have a global scheduling approach for ET tasks. In this paper, we extend the current state-of-the-art in Response-Time Analysis (RTA) and Real-Time Calculus (RTC) to analyze the schedulability of sporadic ET tasks in a homogeneous multi-core TT system. We generalize previous promising results integrating TT and ET tasks using affine envelopes to homogeneous multi-core systems. While our method can be applied to any TT schedule generation mechanism, we also present a concrete schedule synthesis method based on a variant of the Least-Laxity First scheduling approach. We demonstrate the performance of our approach, in terms of both schedulability and runtime, through real-world and synthetic experiments inspired by real workloads. We note that our affine-envelope-based interference bound and the generalized burst limiting constraint (BLC) are also independent of the concrete TT synthesis algorithm and of the underlying timing analysis method (RTA or RTC). This modularity allows the framework to be combined with alternative schedulability analyses or TT schedule generation techniques, while preserving the demonstrated gains in schedulability and scalability for mixed TT and ET workloads on homogeneous multi-core platforms.

Cite As Get BibTex

Anaïs Finzi and Silviu S. Craciunas. Multi-Core Integration of Sporadic Events in Time-Triggered Systems. In 38th European Conference on Real-Time Systems (ECRTS 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 375, pp. 20:1-20:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026) https://doi.org/10.4230/LIPIcs.ECRTS.2026.20

Author Details

Anaïs Finzi
  • TTTech Computertechnik AG, Wien, Austria
Silviu S. Craciunas
  • NXP Semiconductors, Wien, Austria
  • Technical University of Denmark, Kongens Lyngby, Denmark

References

  1. Luis Almeida and Paulo Pedreiras. Scheduling within temporal partitions: Response-time analysis and server design. In Proc. EMSOFT, 2004. URL: https://doi.org/10.1145/1017753.1017772.
  2. Björn Andersson and Jan Jonsson. Some insights on fixed-priority preemptive non-partitioned multiprocessor scheduling. In Proc. RTSS, 2000. Google Scholar
  3. Theodore P. Baker and Michele Cirinei. A necessary and sometimes sufficient condition for the feasibility of sets of sporadic hard-deadline tasks. In Proc. RTSS, 2006. URL: https://doi.org/10.1109/RTSS.2006.7.
  4. Sanjoy Baruah. Techniques for multiprocessor global schedulability analysis. In Proc. RTSS, 2007. URL: https://doi.org/10.1109/RTSS.2007.35.
  5. Sanjoy K. Baruah, Louis E. Rosier, and Rodney R. Howell. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst., 2(4), 1990. URL: https://doi.org/10.1007/BF01995675.
  6. Matthias Becker, Dakshina Dasari, Saad Mubeen, Moris Behnam, and Thomas Nolte. End-to-end timing analysis of cause-effect chains in automotive embedded systems. Journal of Systems Architecture, 80(C), 2017. URL: https://doi.org/10.1016/j.sysarc.2017.09.004.
  7. Marko Bertogna and Michele Cirinei. Response-time analysis for globally scheduled symmetric multiprocessor platforms. In Proc. RTSS, pages 149-160. IEEE, 2007. URL: https://doi.org/10.1109/RTSS.2007.31.
  8. Enrico Bini, Giorgio Buttazzo, and Marko Bertogna. The multi supply function abstraction for multiprocessors. In Proc. RTCSA, 2009. URL: https://doi.org/10.1109/RTCSA.2009.39.
  9. Anne Bouillard, Marc Boyer, and Euriell Le Corronc. Deterministic Network Calculus - From theory to practical implementation. Wiley, 2018. Google Scholar
  10. Anne Bouillard, Laurent Jouhet, and Eric Thierry. Service curves in Network Calculus: dos and don'ts. PhD thesis, INRIA, 2009. Google Scholar
  11. Marc Boyer, Pierre Roux, Hugo Daigmorte, and David Puechmaille. A residual service curve of rate-latency server used by sporadic flows computable in quadratic time for network calculus. In Proc. ECRTS, 2021. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2021.14.
  12. Artem Burmyakov and Borislav Nikolić. An exact comparison of global, partitioned, and semi-partitioned fixed-priority real-time multiprocessor schedulers. Journal of Systems Architecture, 121:102313, 2021. URL: https://doi.org/10.1016/j.sysarc.2021.102313.
  13. Samarjit Chakraborty, Simon Künzli, and Lothar Thiele. A general framework for analysing system properties in platform-based embedded system designs. In Proc. DATE, 2003. URL: https://doi.org/10.1109/DATE.2003.1253607.
  14. Jian-Jia Chen, Georg von der Brüggen, and Niklas Ueter. Push Forward: Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems. In Sebastian Altmeyer, editor, 30th Euromicro Conference on Real-Time Systems (ECRTS 2018), volume 106 of Leibniz International Proceedings in Informatics (LIPIcs), pages 8:1-8:24, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2018.8.
  15. Devesh B Chokshi and Purandar Bhaduri. Modeling fixed priority non-preemptive scheduling with real-time calculus. In Proc. RTCSA, pages 387-392. IEEE, 2008. URL: https://doi.org/10.1109/RTCSA.2008.28.
  16. Silviu S. Craciunas, Ramon Serna Oliver, and Valentin Ecker. Optimal static scheduling of real-time tasks on distributed time-triggered networked systems. In Proc. ETFA. IEEE, 2014. URL: https://doi.org/10.1109/ETFA.2014.7005128.
  17. Calvin Deutschbein, Tom Fleming, Alan Burns, and Sanjoy K. Baruah. Multi-core cyclic executives for safety-critical systems. Science of Computer Programming, 172:102-116, 2019. URL: https://doi.org/10.1016/j.scico.2018.11.004.
  18. Anaïs Finzi, Silviu S. Craciunas, and Marc Boyer. A real-time calculus approach for integrating sporadic events in time-triggered systems. CoRR, abs/2204.10264, 2022. preprint. URL: https://doi.org/10.48550/arXiv.2204.10264.
  19. Anais Finzi, Silviu S. Craciunas, and Marc Boyer. Integrating sporadic events in time-triggered systems via affine envelope approximations. In Proc. RTAS, 2024. URL: https://doi.org/10.1109/RTAS61025.2024.00010.
  20. Anaïs Finzi and Ahlem Mifdaoui. Worst-case timing analysis of AFDX networks with multiple TSN/BLS shapers. IEEE Access, 8:106765-106784, 2020. URL: https://doi.org/10.1109/ACCESS.2020.3000326.
  21. Anaïs Finzi, Ahlem Mifdaoui, Fabrice Frances, and Emmanuel Lochin. Incorporating TSN/BLS in AFDX for mixed-criticality applications: Model and timing analysis. In Proc. WFCS, 2018. URL: https://doi.org/10.1109/WFCS.2018.8402346.
  22. Tom Fleming and Alan Burns. Investigating mixed criticality cyclic executive schedule generation. In Proc. WMC, 2015. Google Scholar
  23. Gerhard Fohler. Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In Proc. RTSS, 1995. URL: https://doi.org/10.1109/REAL.1995.495205.
  24. J. Forrest. CBC: COIN-OR Branch and Cut solver. Available from http://www.coin-or.org/, 2004. Open-source mixed-integer programming solver, led by John Forrest at COIN-OR.
  25. Franz-Josef Gotz. Traffic Shaper for Control Data Traffic (CDT). IEEE 802 AVB Meeting, available at https://www.ieee802.org/1/files/public/docs2012/new-goetz-CtrDataScheduler-0712-v1.pdf, Accessed on 26.01.2022.
  26. Nan Guan. New Techniques for Building Timing-Predictable Embedded Systems. Phd dissertation, Uppsala University, 2013. URL: https://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-209623.
  27. Nan Guan, Martin Stigge, Wang Yi, and Ge Yu. New response time bounds for fixed priority multiprocessor scheduling. In Proc. RTSS, pages 387-397. IEEE, 2009. URL: https://doi.org/10.1109/RTSS.2009.11.
  28. Nan Guan and Wang Yi. Fixed-priority multiprocessor scheduling: Critical instant, response time and utilization bound. In Proc IPDPSW, 2012. URL: https://doi.org/10.1109/IPDPSW.2012.305.
  29. Damir Isović and Gerhard Fohler. Handling sporadic tasks in off-line scheduled distributed real-time systems. In Proc. ECRTS, pages 60-67, 1999. URL: https://doi.org/10.1109/EMRTS.1999.777451.
  30. Damir Isović and Gerhard Fohler. Efficient scheduling of sporadic, aperiodic, and periodic tasks with complex constraints. In Proc. RTSS, 2000. URL: https://doi.org/10.1109/REAL.2000.896010.
  31. Damir Isović and Gerhard Fohler. Handling mixed sets of tasks in combined offline and online scheduled real-time systems. Real-Time Syst., 43(3), 2009. URL: https://doi.org/10.1007/s11241-009-9088-3.
  32. Philipp Ittershagen, Philipp A. Hartmann, Kim Grüttner, and Achim Rettberg. Hierarchical real-time scheduling in the multi-core era — an overview. In Proc. ISORC, 2013. URL: https://doi.org/10.1109/ISORC.2013.6913241.
  33. David S Johnson. Fast algorithms for bin packing. Journal of Computer and System Sciences, 8(3):272-314, 1974. URL: https://doi.org/10.1016/S0022-0000(74)80026-7.
  34. Mathai Joseph and Paritosh Pandya. Finding response times in a real-time system. The Computer Journal, 29(5):390-395, 1986. URL: https://doi.org/10.1093/COMJNL/29.5.390.
  35. Herman Kopetz. Sparse time versus dense time in distributed real-time systems. In Proc. ICDCS, 1992. URL: https://doi.org/10.1109/ICDCS.1992.235008.
  36. Jean-Yves Le Boudec and Patrick Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag, 2001. Google Scholar
  37. Jinkyu Lee and Insik Shin. Demand-based schedulability analysis for real-time multi-core scheduling. Journal of Systems and Software, 89:99-108, 2014. URL: https://doi.org/10.1016/j.jss.2013.09.029.
  38. Hennadiy Leontyev and James H. Anderson. A hierarchical multiprocessor bandwidth reservation scheme with timing guarantees. In Proc. ECRTS, 2008. URL: https://doi.org/10.1109/ECRTS.2008.22.
  39. Hennadiy Leontyev, Samarjit Chakraborty, and James H Anderson. Multiprocessor extensions to real-time calculus. Real-Time Systems, 47:562-617, 2011. URL: https://doi.org/10.1007/S11241-011-9135-8.
  40. Joseph Y.T. Leung. A new algorithm for scheduling periodic, real-time tasks. Algorithmica, 4(1):209-219, 1989. URL: https://doi.org/10.1007/BF01553887.
  41. Jeff T. Linderoth and Ted K. Ralphs. Noncommercial software for mixed-integer linear programming. Technical report 04t-023, Department of Industrial and Systems Engineering, Lehigh University, December 2004. Technical Report, published on Optimization Online. URL: https://optimization-online.org/2004/12/1028/.
  42. Giuseppe Lipari and Enrico Bini. A framework for hierarchical scheduling on multiprocessors: From application requirements to run-time allocation. In Proc. RTSS, 2010. URL: https://doi.org/10.1109/RTSS.2010.12.
  43. Martin Lukasiewycz, Reinhard Schneider, Dip Goswami, and Samarjit Chakraborty. Modular scheduling of distributed heterogeneous time-triggered automotive systems. In Proc. ASP-DAC, 2012. URL: https://doi.org/10.1109/ASPDAC.2012.6165039.
  44. Shane D. McLean, Silviu S. Craciunas, Emil A. Juul Hansen, and Paul Pop. Mapping and scheduling automotive applications on ADAS platforms using metaheuristics. In Proc. ETFA. IEEE, 2020. URL: https://doi.org/10.1109/ETFA46521.2020.9212029.
  45. Shane D. McLean, Emil A. Juul Hansen, Paul Pop, and Silviu S. Craciunas. Configuring ADAS platforms for automotive applications using metaheuristics. Frontiers in Robotics and AI, 8:353, 2022. URL: https://doi.org/10.3389/frobt.2021.762227.
  46. Ayhan Mehmed, Wilfried Steiner, and Maximilian Rosenblattl. A time-triggered middleware for safety-critical automotive applications. In Proc. AEiC, 2017. Google Scholar
  47. Carlo Meroni, Silviu S. Craciunas, Anaïs Finzi, and Paul Pop. Mapping and integration of event- and time-triggered real-time tasks on partitioned multi-core systems. In Proc. ETFA. IEEE, 2023. URL: https://doi.org/10.1109/ETFA54631.2023.10275547.
  48. Matthieu Moy and Karine Altisen. Arrival curves for real-time calculus: the causality problem and its solutions. In Proc. TACAS, 2010. URL: https://doi.org/10.1007/978-3-642-12002-2_31.
  49. Pascal Muoka, Daniel Onwuchekwa, and Roman Obermaisser. Adaptive scheduling for time-triggered network-on-chip-based multi-core architecture using genetic algorithm. Electronics, 11(1), 2022. URL: https://doi.org/10.3390/electronics11010049.
  50. Traian Pop. Scheduling and Optimisation of Heterogeneous Time/Event-Triggered Distributed Embedded Systems. PhD thesis, Linkóping University, 2003. Google Scholar
  51. Traian Pop, Petru Eles, and Zebo Peng. Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems. In Proc. CODES. ACM, 2002. URL: https://doi.org/10.1145/774789.774828.
  52. Traian Pop, Petru Eles, and Zebo Peng. Schedulability analysis for distributed heterogeneous time/event triggered real-time systems. In Proc. ECRTS, 2003. URL: https://doi.org/10.1109/EMRTS.2003.1212751.
  53. Pierre Roux, Sophie Quinton, and Marc Boyer. A formal link between response time analysis and network calculus. In Proc. ECRTS. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. URL: https://doi.org/10.4230/LIPIcs.ECRTS.2022.5.
  54. Saowanee Saewong, Ragunathan Raj Rajkumar, John P. Lehoczky, and Mark H. Klein. Analysis of hierarchical fixed-priority scheduling. In Proc. ECRTS, 2002. URL: https://doi.org/10.1109/EMRTS.2002.1019197.
  55. Florian Sagstetter, Sidharta Andalam, Peter Waszecki, Martin Lukasiewycz, Hauke Stähle, Samarjit Chakraborty, and Alois Knoll. Schedule integration framework for time-triggered automotive architectures. In Proc. DAC, 2014. URL: https://doi.org/10.1145/2593069.2593211.
  56. Insik Shin, Arvind Easwaran, and Insup Lee. Hierarchical scheduling framework for virtual clustering of multiprocessors. In Proc. ECRTS, 2008. URL: https://doi.org/10.1109/ECRTS.2008.28.
  57. Insik Shin and Insup Lee. Periodic resource model for compositional real-time guarantees. In Proc. RTSS. IEEE, 2003. URL: https://doi.org/10.1109/REAL.2003.1253249.
  58. Insik Shin and Insup Lee. Compositional real-time scheduling framework with periodic model. ACM Trans. Embed. Comput. Syst., 7(3), 2008. URL: https://doi.org/10.1145/1347375.1347383.
  59. Deepak Vedha Raj Sudhakar, Karsten Albers, and Frank Slomka. Generalized and scalable offset-based response time analysis of fixed priority systems. Journal of Systems Architecture, 112:101856, 2021. URL: https://doi.org/10.1016/j.sysarc.2020.101856.
  60. Youcheng Sun, Giuseppe Lipari, Nan Guan, and Wang Yi. Improving the response time analysis of global fixed-priority multiprocessor scheduling. In 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications, pages 1-9, 2014. URL: https://doi.org/10.1109/RTCSA.2014.6910543.
  61. Yue Tang, Yuming Jiang, Xu Jiang, and Nan Guan. Pay-burst-only-once in real-time calculus. In Proc. RTCSA, 2019. URL: https://doi.org/10.1109/RTCSA.2019.8864582.
  62. Sivakumar Thangamuthu, Nicola Concer, Pieter J. L. Cuijpers, and Johan J. Lukkien. Analysis of ethernet-switch traffic shapers for in-vehicle networking applications. In Proc. DATE, 2015. URL: https://doi.org/10.7873/DATE.2015.0045.
  63. Lothar Thiele, Samarjit Chakraborty, and Martin Naedele. Real-time calculus for scheduling hard real-time systems. In Proc. ISCAS, volume 4, 2000. URL: https://doi.org/10.1109/ISCAS.2000.858698.
  64. Jia Xu and David Lorge Parnas. Priority scheduling versus pre-run-time scheduling. Real-Time Syst., 18(1):7-23, 2000. URL: https://doi.org/10.1023/A:1008198310125.
  65. Jianguo Yao, Xin Xu, and Xue Liu. Mixcps: Mixed time/event-triggered architecture of cyber–physical systems. Proceedings of the IEEE, 104(5):923-937, 2016. URL: https://doi.org/10.1109/JPROC.2016.2519381.
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-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact