Document Open Access Logo

Analysis of TSN Time-Aware Shapers Using Schedule Abstraction Graphs

Authors Srinidhi Srinivasan , Geoffrey Nelissen , Reinder J. Bril , Nirvana Meratnia

PDF
Thumbnail PDF

File

LIPIcs.ECRTS.2024.16.pdf
  • Filesize: 4.57 MB
  • 24 pages

Document Identifiers

Author Details

Srinidhi Srinivasan
  • Eindhoven University of Technology, The Netherlands
Geoffrey Nelissen
  • Eindhoven University of Technology, The Netherlands
Reinder J. Bril
  • Eindhoven University of Technology, The Netherlands
  • Mälardalen University, Västeras, Sweden
Nirvana Meratnia
  • Eindhoven University of Technology, The Netherlands

Cite AsGet BibTex

Srinidhi Srinivasan, Geoffrey Nelissen, Reinder J. Bril, and Nirvana Meratnia. Analysis of TSN Time-Aware Shapers Using Schedule Abstraction Graphs. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 298, pp. 16:1-16:24, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
https://doi.org/10.4230/LIPIcs.ECRTS.2024.16

Abstract

IEEE Time-Sensitive Networking (TSN) is one of the main solutions considered by the industry to support time-sensitive communication in data-intensive safety-critical and mission-critical applications such as autonomous driving and smart manufacturing. IEEE TSN standardizes several mechanisms to support real-time traffic on Ethernet networks. Time-Aware Shapers (TAS) (IEEE 802.1Qbv) is the standardized mechanisms of TSN that is usually considered to provide the most deterministic behavior for packet forwarding. TAS regulates when traffic classes may forward incoming packets to the egress of a TSN switch using gates that are opened and closed according to a time-triggered schedule. State-of-the-art solutions to configure or analyze TAS do not allow for multiple traffic classes to have their TAS gates opened at the same time according to any arbitrary schedule. In this paper, we present the first response-time analysis for traffic shaped with TAS where no restriction is enforced on the gate schedule. The proposed analysis is exact. It is a non-trivial variant of the schedule abstraction graph analysis framework [Nasri and Brandenburg, 2017]. Experiments confirm the usefulness of the proposed analysis and show that it is promising for doing design-space exploration where non-conventional TAS gates configurations are investigated to, for instance, improve average-case performance without degrading the worst-case.

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Networks → Network protocols
Keywords
  • TSN
  • Time-Aware Shapers
  • TAS
  • SAG
  • Schedule Abstraction
  • latency

Metrics

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

Supplementary Materials

References

  1. Time-sensitive networking (TSN) task group. URL: https://1.ieee802.org/tsn/.
  2. IEEE standard for local and metropolitan area networks-bridges and bridged networks, 2022. IEEE Std 802.1Q-2022 (Revision of IEEE Std 802.1Q-2018). Google Scholar
  3. Mohammad Ashjaei, Lucia Lo Bello, Masoud Daneshtalab, Gaetano Patti, Sergio Saponara, and Saad Mubeen. Time-sensitive networking in automotive embedded systems: State of the art and research opportunities. Journal of systems architecture, 117:102137, 2021. Google Scholar
  4. Neil Audsley, Alan Burns, Mike Richardson, Ken Tindell, and Andy J. Wellings. Applying new scheduling theory to static priority preemptive scheduling. Software Engineering Journal, 8(5):284-292, 1993. Google Scholar
  5. Lucia Lo Bello, Mohammad Ashjaei, Gaetano Patti, and Moris Behnam. Schedulability analysis of time-sensitive networks with scheduled traffic and preemption support. Journal of Parallel and Distributed Computing, 144:153-171, 2020. Google Scholar
  6. Unmesh D Bordoloi, Amir Aminifar, Petru Eles, and Zebo Peng. Schedulability analysis of ethernet AVB switches. In 2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications, pages 1-10. IEEE, 2014. Google Scholar
  7. Jingyue Cao, Pieter JL Cuijpers, Reinder J Bril, and Johan J Lukkien. Independent yet tight WCRT analysis for individual priority classes in ethernet AVB. In Proc. 24th International Conference on Real-Time Networks and Systems, pages 55-64, 2016. Google Scholar
  8. Joan Adrià Ruiz De Azua and Marc Boyer. Complete modelling of AVB in network calculus framework. In Proc. 22nd International Conference on Real-Time Networks and Systems, pages 55-64, 2014. Google Scholar
  9. Libing Deng, Guoqi Xie, Hong Liu, Yunbo Han, Renfa Li, and Keqin Li. A survey of real-time ethernet modeling and design methodologies: From AVB to TSN. ACM Computing Surveys (CSUR), 55(2):1-36, 2022. Google Scholar
  10. Jonas Diemer, Jonas Rox, and Rolf Ernst. Modeling of ethernet AVB networks for worst-case timing analysis. IFAC Proceedings Volumes, 45(2):848-853, 2012. Google Scholar
  11. Jonas Diemer, Daniel Thiele, and Rolf Ernst. Formal worst-case timing analysis of ethernet topologies with strict-priority and AVB switching. In 7th IEEE International Symposium on Industrial Embedded Systems (SIES), pages 1-10. IEEE, 2012. Google Scholar
  12. Paul Emberson, Roger Stafford, and Robert I Davis. Techniques for the synthesis of multiprocessor tasksets. In WATERS, pages 6-11, 2010. Google Scholar
  13. Voica Gavriluţ and Paul Pop. Scheduling in time sensitive networks (TSN) for mixed-criticality industrial applications. In 2018 14th IEEE International Workshop on Factory Communication Systems (WFCS), pages 1-4. IEEE, 2018. Google Scholar
  14. Voica Gavriluţ and Paul Pop. Traffic-type assignment for TSN-based mixed-criticality cyber-physical systems. ACM Transactions on Cyber-physical Systems, 4(2):1-27, 2020. Google Scholar
  15. Pourya Gohari, Jeroen Voeten, and Mitra Nasri. Reachability-based Response-Time Analysis of Preemptive Tasks under Global Scheduling. In 36th Euromicro Conference on Real-Time Systems (ECRTS 2024), pages 3:1-3:23, 2024. Google Scholar
  16. Xiaoting Li and Laurent George. Deterministic delay analysis of AVB switched ethernet networks using an extended trajectory approach. Real-Time Systems, 53(1):121-186, 2017. Google Scholar
  17. Rouhollah Mahfouzi, Amir Aminifar, Soheil Samii, Ahmed Rezine, Petru Eles, and Zebo Peng. Stability-aware integrated routing and scheduling for control applications in ethernet networks. In 2018 Design, Automation & Test in Europe Conference & Exhibition (DATE), pages 682-687. IEEE, 2018. Google Scholar
  18. Mitra Nasri and Björn B. Brandenburg. An Exact and Sustainable Analysis of Non-preemptive Scheduling. In RTSS, pages 12-23, 2017. Google Scholar
  19. Mitra Nasri and Björn B. Brandenburg. Offline equivalence: A non-preemptive scheduling technique for resource-constrained embedded real-time systems (outstanding paper). In 2017 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 75-86, 2017. URL: https://doi.org/10.1109/RTAS.2017.34.
  20. Mitra Nasri and Gerhard Fohler. Non-work-conserving non-preemptive scheduling: motivations, challenges, and potential solutions. In ECRTS, pages 165-175, 2016. Google Scholar
  21. Mitra Nasri, Geoffrey Nelissen, and Björn B. Brandenburg. A Response-Time Analysis for Non-Preemptive Job Sets under Global Scheduling. In ECRTS, pages 9:1-9:23, 2018. Google Scholar
  22. Mitra Nasri, Geoffrey Nelissen, and Björn B. Brandenburg. Response-time analysis of limited-preemptive parallel DAG tasks under global scheduling. In ECRTS, pages 21:1-21:23, 2019. Google Scholar
  23. Geoffrey Nelissen, Joan Marce-i Igual, and Mitra Nasri. Response-Time Analysis for Non-Preemptive Periodic Moldable Gang Tasks. In ECRTS, pages 12:1-12:22, 2022. Google Scholar
  24. Suhail Nogd, Geoffrey Nelissen, Mitra Nasri, and Björn B. Brandenburg. Response-Time Analysis for Non-Preemptive Global Scheduling with FIFO Spin Locks. In RTSS, pages 115-127, 2020. Google Scholar
  25. Maryam Pahlevan and Roman Obermaisser. Genetic algorithm for scheduling time-triggered traffic in time-sensitive networks. In 2018 IEEE 23rd international conference on emerging technologies and factory automation (ETFA), volume 1, pages 337-344. IEEE, 2018. Google Scholar
  26. Rene Queck. Analysis of ethernet AVB for automotive networks using network calculus. In 2012 IEEE International Conference on Vehicular Electronics and Safety (ICVES 2012), pages 61-67. IEEE, 2012. Google Scholar
  27. Michael Lander Raagaard and Paul Pop. Optimization algorithms for the scheduling of IEEE 802.1 time-sensitive networking (TSN). tech. univ. denmark, lyngby. Technical report, Denmark, Tech. Rep, 2017. Google Scholar
  28. Sayra Ranjha, Geoffrey Nelissen, and Mitra Nasri. Partial-Order Reduction for Schedule-Abstraction-based Response-Time Analyses of Non-Preemptive Tasks. In RTAS, pages 121-132, 2022. Google Scholar
  29. Daniel Thiele, Rolf Ernst, and Jonas Diemer. Formal worst-case timing analysis of ethernet TSN’s time-aware and peristaltic shapers. In 2015 IEEE Vehicular Networking Conference (VNC), pages 251-258. IEEE, 2015. Google Scholar
  30. Luxi Zhao, Paul Pop, and Silviu S Craciunas. Worst-case latency analysis for IEEE 802.1 qbv time sensitive networks using network calculus. IEEE Access, 6:41803-41815, 2018. Google Scholar
  31. Luxi Zhao, Paul Pop, Zhong Zheng, Hugo Daigmorte, and Marc Boyer. Latency analysis of multiple classes of AVB traffic in TSN with standard credit behavior using network calculus. IEEE Transactions on Industrial Electronics, 68(10):10291-10302, 2020. Google Scholar
  32. Yimi Zhao, Srinidhi Srinivasan, Geoffrey Nelissen, and Mitra Nasri. Work-in-progress: Generating counter-examples to schedulability using the schedule abstraction. In 2023 IEEE Real-Time Systems Symposium (RTSS), pages 459-462. IEEE, 2023. 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 Imprint Privacy Contact