Combined task- and network-level scheduling for distributed time-triggered systems

Real-Time Systems

Volumn 52, Issue 2, 2016, Pages 161-200

  Craciunas, Silviu S ^a   Oliver, Ramon Serna ^a  

^a TTTech Computertechnik AG   (Austria)

Author keywords

Distributed systems; MIP; Mixed criticality; Scheduling; SMT; Time triggered

Indexed keywords

ACCIDENT PREVENTION; APPLICATION PROGRAMS; COMPUTATIONAL COMPLEXITY; COST EFFECTIVENESS; FORMAL LOGIC; INTEGER PROGRAMMING; OPTIMIZATION; SCHEDULING; SURFACE MOUNT TECHNOLOGY; SWITCHING CIRCUITS;

DISTRIBUTED APPLICATIONS; DISTRIBUTED SYSTEMS; MIP; MIXED CRITICALITIES; MIXED INTEGER PROGRAMMING (MIP); SATISFIABILITY MODULO THEORIES; TIME TRIGGERED; TIME-TRIGGERED COMMUNICATIONS;

MULTITASKING;

EID: 84958765375     PISSN: 09226443     EISSN: 15731383     Source Type: Journal    
DOI: 10.1007/s11241-015-9244-x     Document Type: Article

References (62)

1. Abdelzahe TF, Shin KG (1995) Optimal combined task and message scheduling in distributed real-time systems. In: Proc. RTSS. IEEE Computer Society
2. Abdelzaher TF, Shin KG (1999) Combined task and message scheduling in distributed real-time systems. IEEE Trans Parallel Distrib Syst 10(11):1179–1191
3. Al Sheikh A, Brun O, Chéramy M, Hladik PE (2013) Optimal design of virtual links in afdx networks. Real-Time Syst 49(3):308–336
4. Al Sheikh A, Brun O, Hladik PE, Prabhu BJ (2012) Strictly periodic scheduling in ima-based architectures. Real-Time Syst 48(4):359–386
5. ARINC Report 664P7-1 (2009) Aircraft Data Network, Part 7: Avionics Full Duplex Switched Ethernet (AFDX) Network
6. Barrett C, Sebastiani R, Seshia S, Tinelli C (2009) Satisfiability modulo theories. Handbook of satisfiability, vol 185. IOS Press, Amsterdam
7. Baruah SK, Rosier LE, Howell RR (1990) Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Syst 2(4):301–324
8. Bisschop J (2006) Aimms optimization modeling. Paragon Decision Technology, Haarlem
9. Bradley S, Hax A, Magnanti T (1977) Applied mathematical programming. Addison-Wesley, Reading
10. Buttazzo GC (2004) Hard real-time computing systems: predictable scheduling algorithms and applications (real-time systems series). Springer, New York
11. Chetto H, Silly M, Bouchentouf T (1990) Dynamic scheduling of real-time tasks under precedence constraints. Real-Time Syst 2(3):181–194
12. Computer Science Laboratory—SRI International: The Yices SMT Solver. URL: http://yices.csl.sri.com/. Retrieved 15-Apr-2015
13. Craciunas SS, Serna Oliver R (2014) SMT-based task- and network-level static schedule generation for time-triggered networked systems. In: Proc. RTNS. ACM
14. Craciunas SS, Serna Oliver R, Ecker V (2014) Optimal static scheduling of real-time tasks on distributed time-triggered networked systems. In: Proc. ETFA. IEEE Computer Society
15. De Moura L, Bjørner N (2008) Z3: an efficient SMT solver. In: Proc. TACAS. Springer
16. De Moura L, Bjørner N (2011) Satisfiability modulo theories: introduction and applications. Commun ACM 54(9):69–77
17. Derler P, Resmerita S (2010) Flexible static scheduling of software with logical execution time constraints. In: Proc. CIT. IEEE
18. Forget J, Boniol F, Grolleau E, Lesens D, Pagetti C (2010) Scheduling dependent periodic tasks without synchronization mechanisms. In: Proc. RTAS. IEEE Computer Society
19. Forget J, Grolleau E, Pagetti C, Richard P (2011) Dynamic priority scheduling of periodic tasks with extended precedences. In: Proc. ETFA. IEEE Computer Society
20. Gaglio S, Re G (2013) Advances onto the internet of things: how ontologies make the internet of things meaningful. Advances in Intelligent Systems And Computing. Springer, Cham
21. GLPK: GNU Linear Programming Kit. URL: http://www.gnu.org/software/glpk/. Retrieved 10-Jan-2015
22. Gurobi Optimization I (2014) Gurobi optimizer reference manual, version 6.0. URL: http://www.gurobi.com. Retrieved 12-Jan-2015
23. Hanzalek Z, Burget P, Šucha P (2009) Profinet IO IRT message scheduling. In: Proc. ECRTS. IEEE Computer Society
24. Honeywell Aerospace (2014) Application specific integrated circuits based on TTEthernet ready for first Orion test flight. URL: http://aerospace.honeywell.com/about/media-resources/newsroom. Retrieved 22-May-2014
25. Huang J, Blech JO, Raabe A, Buckl C, Knoll A (2012) Static scheduling of a time-triggered network-on-chip based on SMT solving. In: Proc. DATE. IEEE Computer Society
26. Institute of Electrical and Electronics Engineers, Inc 802.1Qbv (2015) Enhancements for Scheduled Traffic. URL: http://www.ieee802.org/1/pages/802.1bv.html. Retrieved 20-Jan-2015
27. Institute of Electrical and Electronics Engineers, Inc (2015) Time-sensitive networking task group. URL: http://www.ieee802.org/1/pages/tsn.html. Retrieved 20-Jan-2015
28. Kermia O, Cucu L, Sorel Y (2006) Non-preemptive multiprocessor static scheduling for systems with precedence and strict periodicity constraints. In: Proc. PMS
29. Kermia O, Sorel Y (2008) Load balancing and efficient memory usage for homogeneous distributed real-time embedded systems. In: Proc. ICPP-W. IEEE
30. Kermia O, Sorel Y (2008) Schedulability analysis for non-preemptive tasks under strict periodicity constraints. In: Proc. RTCSA. IEEE Computer Society
31. Kopetz H (1997) Real-time systems: design principles for distributed embedded applications. Kluwer Academic Publishers, Boston
32. Kopetz H, Ademaj A, Grillinger P, Steinhammer K (2005) The time-triggered ethernet (TTE) design. In: Proc. ISORC. IEEE
33. Kopetz H, Bauer G (2003) The time-triggered architecture. Proc IEEE 91(1):112–126
34. Kopetz H, Grunsteidl G (1993) Ttp—a time-triggered protocol for fault-tolerant real-time systems. In: The 23rd International Symposium on Fault-Tolerant Computing, 1993. FTCS-23. Digest of Papers, pp. 524–533
35. Leung J, Kelly L, Anderson JH (2004) Handbook of scheduling: algorithms, models, and performance analysis. CRC Press, Boca Raton
36. Leung JYT, Merrill M (1980) A note on preemptive scheduling of periodic, real-time tasks. Inf Process Lett 11(3):115–118
37. Liu CL, Layland JW (1973) Scheduling algorithms for multiprogramming in a hard-real-time environment. J ACM 20:46–61
38. Meindl B, Templ M (2013) Analysis of commercial and free and open source solvers for the cell suppression problem. Trans Data Priv 6(2):147–159
39. Metzner A, Franzle M, Herde C, Stierand I (2005) Scheduling distributed real-time systems by satisfiability checking. In: Proc. RTCSA. IEEE Computer Society
40. Moura L, Bjørner N (2009) Satisfiability modulo theories: an appetizer. Formal methods: foundations and applications. Springer, Berlin, pp 23–36
41. NASA (2014) Orion Exploration Flight Test-1. URL: https://www.nasa.gov/pdf/663703main_flighttest1_fs_051812.pdf. Retrieved 24-Jun-2015
42. Nikoletseas S, Rolim J (2011) Theoretical aspects of distributed computing in sensor networks. Monographs in theoretical computer science. An EATCS series. Springer, Berlin
43. Ousterhout K, Wendell P, Zaharia M, Stoica I (2013) Sparrow: distributed, low latency scheduling. In: Proc SOSP. ACM
44. Pellizzoni R, Lipari G (2004) A new sufficient feasibility test for asynchronous real-time periodic task sets. In: Proc. ECRTS. IEEE Computer Society
45. Pellizzoni R, Lipari G (2005) Feasibility analysis of real-time periodic tasks with offsets. Real-Time Syst 30(1–2):105–128
46. Peng DT, Shin K, Abdelzaher T (1997) Assignment and scheduling communicating periodic tasks in distributed real-time systems. IEEE Trans Softw Eng 23(12):745–758
47. Pop P, Eles P, Peng Z (1999) An improved scheduling technique for time-triggered embedded systems. In: Proc. EUROMICRO. IEEE Computer Society
48. Pop P, Eles P, Peng Z (2004) Schedulability-driven communication synthesis for time triggered embedded systems. Real-Time Syst 26(3):297–325
49. Pop T, Eles P, Peng Z (2002) Holistic scheduling and analysis of mixed time/event-triggered distributed embedded systems. In: Proc. CODES. ACM
50. Sebastiani R (2007) Lazy satisfiability modulo theories. JSAT 3(3–4):141–224
51. Serna Oliver R, Craciunas SS, Stöger G (2014) Analysis of Deterministic Ethernet Scheduling For The Industrial Internet Of Things. In: Proc. CAMAD. IEEE
52. Stankovic J (1998) Deadline scheduling for real-time systems: EDF and related. Real-time systems series. Springer, New York
53. Steiner W (2010) An evaluation of SMT-based schedule synthesis for time-triggered multi-hop networks. In: Proc. RTSS. IEEE Computer Society
54. Steiner W (2011) Synthesis of static communication schedules for mixed-criticality systems. In: Proc. ISORCW. IEEE Computer Society
55. Steiner W, Bauer G, Hall B, Paulitsch M (2011) TTEthernet: time-triggered ethernet. In: Obermaisser R (ed) Time-triggered communication. CRC Press, Boca Raton
56. Steiner W, Dutertre B (2011) Automated formal verification of the TTEthernet synchronization quality. NASA formal methods. Lecture notes in computer science, vol 5517. Springer, Berlin
57. Tamas-Selicean D, Pop P, Steiner W (2012) Synthesis of communication schedules for TTEthernet-based mixed-criticality systems. In: Proc. CODES+ISSS. ACM
58. Texas Instruments: TMS570LS Series 16/32-BIT RISC Flash Microcontroller. URL: http://www.ti.com/lit/ds/symlink/tms570ls3137.pdf. Retrieved 12-Jun-2014
59. Yomsi PM, Sorel Y (2009)S chedulability analysis for non necessarily harmonic real-time systems with precedence and strict periodicity constraints using the exact number of preemptions and no idle time. In: Proc. MISTA
60. Zeng H, Zheng W, Di Natale M, Ghosal A, Giusto P, Sangiovanni-Vincentelli A (2009) Scheduling the flexray bus using optimization techniques. In: Proc. DAC. ACM
61. Zhang L, Goswami D, Schneider R, Chakraborty S (2014) Task- and network-level schedule co-synthesis of ethernet-based time-triggered systems. In: Proc. ASP-DAC. IEEE Computer Society
62. Zurawski R (2014) Industrial communication technology handbook. Industrial information technology. Taylor & Francis, Boca Raton