skip to main content
10.1145/2659787.2659812acmotherconferencesArticle/Chapter ViewAbstractPublication PagesrtnsConference Proceedingsconference-collections
research-article

SMT-based Task- and Network-level Static Schedule Generation for Time-Triggered Networked Systems

Published: 08 October 2014 Publication History

Abstract

In Ethernet-based time-triggered networks, like TTEthernet, a global communication scheme, for which the schedule synthesis is known to be an NP-complete problem, establishes contention-free windows for the exchange of messages with guaranteed low latency and minimal jitter. However, in order to achieve end-to-end determinism at the application level, software tasks running on the end-system nodes need to obey a similar execution scheme with tight dependencies towards the network domain. In this paper we address the simultaneous co-synthesis of network as well as application schedules for preemptive time-triggered tasks communicating in a switched multi-speed time-triggered network. We use Satisfiability Modulo Theories (SMT) to formulate the scheduling constraints and solve the resulting problem using a state-of-the-art SMT solver. Furthermore, we introduce a novel incremental scheduling approach, based on the demand bound test for asynchronous constrained-deadline periodic tasks, which significantly improves scalability for the average case without sacrificing schedulability. We demonstrate the performance of our approach using synthetic network topologies and system configurations.

References

[1]
ARINC Report 664P7-1. Aircraft Data Network, Part 7: Avionics Full Duplex Switched Ethernet (AFDX) Network, Sept. 2009.
[2]
Barrett, C., Sebastiani, R., Seshia, S., and Tinelli, C. Satisfiability modulo theories. In Handbook of Satisfiability, vol. 185. IOS Press, 2009.
[3]
Baruah, S. K., Rosier, L. E., and Howell, R. R. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst. 2, 4 (1990).
[4]
Buttazzo, G. C. Hard Real-time Computing Systems: Predictable Scheduling Algorithms And Applications (Real-Time Systems Series). Springer-Verlag, 2004.
[5]
Chetto, H., Silly, M., and Bouchentouf, T. Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Syst. 2, 3 (1990).
[6]
Computer Science Laboratory -- SRI International. The Yices SMT Solver. http://yices.csl.sri.com/. retrieved 27-Apr-2014.
[7]
Craciunas, S. S., Oliver, R. S., and Ecker, V. Optimal static scheduling of real-time tasks on distributed time-triggered networked systems. In Proc. ETFA (2014), IEEE Computer Society.
[8]
De Moura, L., and Bjørner, N. Satisfiability modulo theories: Introduction and applications. Commun. ACM 54, 9 (2011), 69--77.
[9]
Derler, P., and Resmerita, S. Flexible static scheduling of software with logical execution time constraints. In Proc. CIT (2010), IEEE.
[10]
Forget, J., Grolleau, E., Pagetti, C., and Richard, P. Dynamic priority scheduling of periodic tasks with extended precedences. In Proc. ETFA (2011), IEEE Computer Society.
[11]
Hanzalek, Z., Burget, P., and Šucha, P. Profinet IO IRT message scheduling. In Proc. ECRTS (2009), IEEE Computer Society.
[12]
Honeywell Aerospace. Application specific integrated circuits based on TTEthernet ready for first Orion test flight. http://aerospace.honeywell.com/about/media-resources/newsroom, 2014. retrieved 22-May-2014.
[13]
Huang, J., Blech, J. O., Raabe, A., Buckl, C., and Knoll, A. Static scheduling of a time-triggered network-on-chip based on SMT solving. In Proc. DATE (2012), IEEE Computer Society.
[14]
Issuing Committee: As-2d2 Deterministic Ethernet And Unified Networking. SAE AS6802 time-triggered ethernet. http://standards.sae.org/as6802/, 2011. retrieved 20-May-2014.
[15]
Kopetz, H. Real-Time Systems: Design Principles for Distributed Embedded Applications. Kluwer Academic Publishers, 1997.
[16]
Kopetz, H., Ademaj, A., Grillinger, P., and Steinhammer, K. The time-triggered ethernet (TTE) design. In Proc. ISORC (2005), IEEE.
[17]
Leung, J., Kelly, L., and Anderson, J. H. Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press, Inc., 2004.
[18]
Leung, J. Y.-T., and Merrill, M. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters 11, 3 (1980), 115--118.
[19]
Liu, C. L., and Layland, J. W. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 20 (1973), 46--61.
[20]
Metzner, A., Franzle, M., Herde, C., and Stierand, I. Scheduling distributed real-time systems by satisfiability checking. In Proc. RTCSA (2005), IEEE Computer Society.
[21]
Moura, L., and Bjørner, N. Satisfiability modulo theories: An appetizer. In Formal Methods: Foundations and Applications, vol. 5902. Springer Berlin Heidelberg, 2009, pp. 23--36.
[22]
Pellizzoni, R., and Lipari, G. A new sufficient feasibility test for asynchronous real-time periodic task sets. In Proc. ECRTS (2004), IEEE Computer Society.
[23]
Pellizzoni, R., and Lipari, G. Feasibility analysis of real-time periodic tasks with offsets. Real-Time Syst. 30, 1-2 (2005), 105--128.
[24]
Pop, P., Eles, P., and Peng, Z. An improved scheduling technique for time-triggered embedded systems. In Proc. EUROMICRO (1999), IEEE Computer Society.
[25]
Pop, P., Eles, P., and Peng, Z. Schedulability-driven communication synthesis for time triggered embedded systems. Real-Time Syst. 26, 3 (2004), 297--325.
[26]
Pop, T., Eles, P., and Peng, Z. Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems. In Proc. CODES (2002), ACM.
[27]
Sebastiani, R. Lazy satisfiability modulo theories. JSAT 3, 3-4 (2007), 141--224.
[28]
Steiner, W. An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In Proc. RTSS (2010), IEEE Computer Society.
[29]
Steiner, W. Synthesis of static communication schedules for mixed-criticality systems. In Proc. ISORCW (2011), IEEE Computer Society.
[30]
Steiner, W., Bauer, G., Hall, B., and Paulitsch, M. TTEthernet: Time-Triggered Ethernet. In Time-Triggered Communication, R. Obermaisser, Ed. CRC Press, Aug 2011.
[31]
Steiner, W., and Dutertre, B. Automated formal verification of the TTEthernet synchronization quality. In NASA Formal Methods, vol. 6617 of Lecture Notes in Computer Science. Springer, 2011.
[32]
Tamas-Selicean, D., Pop, P., and Steiner, W. Synthesis of communication schedules for ttethernet-based mixed-criticality systems. In Proc. CODES+ISSS (2012), ACM.
[33]
Texas Instruments. TMS570LS Series 16/32-BIT RISC Flash Microcontroller. http://www.ti.com/lit/ds/symlink/tms570ls3137.pdf. retrieved 12-Jun-2014.
[34]
Zeng, H., Zheng, W., Di Natale, M., Ghosal, A., Giusto, P., and Sangiovanni-Vincentelli, A. Scheduling the flexray bus using optimization techniques. In Proc. DAC (2009), ACM.
[35]
Zhang, L., Goswami, D., Schneider, R., and Chakraborty, S. Task- and network-level schedule co-synthesis of Ethernet-based time-triggered systems. In Proc. ASP-DAC (2014), IEEE Computer Society.

Cited By

View all
  • (2025)GTSNet: A Generalized Traffic Scheduler for Time-Sensitive Networking Based on Graph Neural NetworkIEEE Transactions on Industrial Informatics10.1109/TII.2024.345009921:1(208-217)Online publication date: Jan-2025
  • (2024)Optimizing Traffic Scheduling in Autonomous Vehicle Networks Using Machine Learning Techniques and Time-Sensitive NetworkingElectronics10.3390/electronics1314283713:14(2837)Online publication date: 18-Jul-2024
  • (2024)Time-Sensitive Networking (TSN) for Industrial Automation: Current Advances and Future DirectionsACM Computing Surveys10.1145/369524857:2(1-38)Online publication date: 10-Oct-2024
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
RTNS '14: Proceedings of the 22nd International Conference on Real-Time Networks and Systems
October 2014
335 pages
ISBN:9781450327275
DOI:10.1145/2659787
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • CEA: Commissariat à l'énergie atomique et aux énergies alternatives
  • GDR ASR: GDR Architecture, Systèmes et Réseaux

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 08 October 2014

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

RTNS '14

Acceptance Rates

Overall Acceptance Rate 119 of 255 submissions, 47%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)29
  • Downloads (Last 6 weeks)4
Reflects downloads up to 13 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2025)GTSNet: A Generalized Traffic Scheduler for Time-Sensitive Networking Based on Graph Neural NetworkIEEE Transactions on Industrial Informatics10.1109/TII.2024.345009921:1(208-217)Online publication date: Jan-2025
  • (2024)Optimizing Traffic Scheduling in Autonomous Vehicle Networks Using Machine Learning Techniques and Time-Sensitive NetworkingElectronics10.3390/electronics1314283713:14(2837)Online publication date: 18-Jul-2024
  • (2024)Time-Sensitive Networking (TSN) for Industrial Automation: Current Advances and Future DirectionsACM Computing Surveys10.1145/369524857:2(1-38)Online publication date: 10-Oct-2024
  • (2023)TSN Network Scheduling—Challenges and ApproachesNetwork10.3390/network30400263:4(585-624)Online publication date: 16-Dec-2023
  • (2023)Methods to Realize Preemption in Phased Execution ModelsACM Transactions on Embedded Computing Systems10.1145/360913222:5s(1-25)Online publication date: 31-Oct-2023
  • (2023)Access mechanism for period flows of non-deterministic end systems for time-sensitive networksComputer Networks10.1016/j.comnet.2023.109805231(109805)Online publication date: Jul-2023
  • (2022)Improving Symbolic System-Level Synthesis by Solver Coordination and Domain-Specific HeuristicsElectronics10.3390/electronics1112188811:12(1888)Online publication date: 16-Jun-2022
  • (2022)Ethernet networks with deterministic delaysVestnik of Samara State Technical University. Technical Sciences Series10.14498/tech.2022.3.630:3(81-97)Online publication date: 4-Dec-2022
  • (2022)Egress-TT Configurations for TSN NetworksProceedings of the 30th International Conference on Real-Time Networks and Systems10.1145/3534879.3534885(58-69)Online publication date: 7-Jun-2022
  • (2022)Adaptive Priority Adjustment Scheduling Approach With Response-Time Analysis in Time-Sensitive NetworksIEEE Transactions on Industrial Informatics10.1109/TII.2022.315004418:12(8714-8723)Online publication date: Dec-2022
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media