Abstract
Loosely Time-Triggered Architectures (LTTAs) are a proposal for constructing distributed embedded control systems. They build on the quasi-periodic architecture, where computing units execute nearly periodically, by adding a thin layer of middleware that facilitates the implementation of synchronous applications.
In this article, we show how the deployment of a synchronous application on a quasi-periodic architecture can be modeled using a synchronous formalism. Then we detail two protocols, Back-Pressure LTTA, reminiscent of elastic circuits, and Time-Based LTTA, based on waiting. Compared to previous work, we present controller models that can be compiled for execution, a simplified version of the Time-Based protocol and optimizations for systems using broadcast communication. We also compare the LTTA approach with architectures based on clock synchronization.
- Hagit Attiya, Cynthia Dwork, Nancy Lynch, and Larry Stockmeyer. 1994. Bounds on the time to reach agreement in the presence of timing uncertainty. J. ACM 41, 1 (1994), 122--152. Google Scholar
Digital Library
- Guillaume Baudart, Albert Benveniste, Anne Bouillard, and Paul Caspi. 2014. A Unifying View of Loosely Time-Triggered Architectures. Technical Report RR-8494. INRIA. Corrected version of Benveniste et al. {2010}.Google Scholar
- Albert Benveniste, Anne Bouillard, and Paul Caspi. 2010. A unifying view of loosely time-triggered architectures. In EMSOFT’10. USA, 189--198. Google Scholar
Digital Library
- Albert Benveniste, Benoît Caillaud, and Paul Le Guernic. 2000. Compositionality in dataflow synchronous languages: Specification and distributed code generation. Inform. Comput. 163, 1 (2000), 125--171. Google Scholar
Digital Library
- Albert Benveniste, Paul Caspi, Marco Di Natale, Claudio Pinello, Alberto L. Sangiovanni-Vincentelli, and Stavros Tripakis. 2007. Loosely time-triggered architectures based on communication-by-sampling. In EMSOFT’07. Austria, 231--239. Google Scholar
Digital Library
- Albert Benveniste, Paul Caspi, Stephen A. Edwards, Nicolas Halbwachs, Paul Le Guernic, and Robert De Simone. 2003. The synchronous languages 12 years later. Proc. IEEE 91, 1 (2003), 64--83.Google Scholar
- Albert Benveniste, Paul Caspi, Paul Le Guernic, Hervé Marchand, Jean-Pierre Talpin, and Stavros Tripakis. 2002. A protocol for loosely time-triggered architectures. In EMSOFT’02. France, 252--265. Google Scholar
Digital Library
- Timothy Bourke and Marc Pouzet. 2013. Zélus: A synchronous language with ODEs. In HSCC’13. USA, 113--118. Google Scholar
Digital Library
- Luca P. Carloni. 2006. The role of back-pressure in implementing latency-insensitive systems. Elec. Not. Theoret. Comput. Sci. 146, 2 (2006), 61--80. Google Scholar
Digital Library
- Luca P. Carloni, Kenneth L. McMillan, and Alberto L. Sangiovanni-Vincentelli. 2001. Theory of latency-insensitive design. IEEE Trans. Comput.-Aid. Des. Integr. Circuit. Syst. 20, 9 (2001), 1059--1076. Google Scholar
Digital Library
- Luca P. Carloni and Alberto L. Sangiovanni-Vincentelli. 2002. Coping with latency in SoC design. IEEE Micro 22, 5 (2002), 24--35. Google Scholar
Digital Library
- Paul Caspi. 2000. The Quasi-Synchronous Approach to Distributed Control Systems. Technical Report CMA/009931. VERIMAG, Crysis Project. “The Cooking Book.”Google Scholar
- Paul Caspi and Albert Benveniste. 2008. Time-robust discrete control over networked loosely time-triggered architectures. In CDC’08. Mexico, 3595--3600.Google Scholar
- Paul Caspi, Alain Girault, and Daniel Pilaud. 1994. Distributing reactive systems. In PDCS’94. 101--107.Google Scholar
- Paul Caspi, Daniel Pilaud, Nicolas Halbwachs, and John Plaice. 1987. Lustre: A declarative language for programming synchronous systems. In POPL’87. 178--188. Google Scholar
Digital Library
- James C. Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, J. J. Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, and others. 2012. Spanner: Google’s globally distributed database. In OSDI’12. USA, 261--264. Google Scholar
Digital Library
- Jordi Cortadella and Michael Kishinevsky. 2007. Synchronous elastic circuits with early evaluation and token counterflow. In DAC’07. USA, 416--419. Google Scholar
Digital Library
- Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, and Christos P. Sotiriou. 2006. Desynchronization: Synthesis of asynchronous circuits from synchronous specifications. IEEE Trans. Comput.-Aid. Des. Integr. Circuit Syst. 25, 10 (2006), 1904--1921. Google Scholar
Digital Library
- Nicolas Halbwachs and Siwar Baghdadi. 2002. Synchronous modelling of asynchronous systems. In EMSOFT’02. France, 240--251. Google Scholar
Digital Library
- Nicolas Halbwachs, Paul Caspi, Pascal Raymond, and Daniel Pilaud. 1991. The synchronous dataflow programming language Lustre. Proc. IEEE 79, 9 (1991), 1305--1320.Google Scholar
Cross Ref
- Nicolas Halbwachs and Louis Mandel. 2006. Simulation and verification of aysnchronous systems by means of a synchronous model. In ACSD’06. Finland, 3--14. Google Scholar
Digital Library
- Gilles Kahn. 1974. The semantics of a simple language for parallel programming. In IFIP’74. Sweden, 471--475.Google Scholar
- Hermann Kopetz. 2011. Real-Time Systems: Design Principles for Distributed Embedded Applications. Springer-Verlag, Berlin. Google Scholar
Digital Library
- Hermann Kopetz and Günther Bauer. 2003. The time-triggered architecture. Proc. IEEE 91, 1 (2003), 112--126.Google Scholar
Cross Ref
- Kang Lee, John C. Eidson, Hans Weibel, and Dirk Mohl. 2005. IEEE 1588-Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. Technical Report.Google Scholar
- Nancy A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann, San Francisco, CA. Google Scholar
Digital Library
- Florence Maraninchi and Yann Rémond. 2001. Argos: An automaton-based synchronous language. Comput. Lang. 27, 1--3 (2001), 61--92. Google Scholar
Digital Library
- David L. Mills. 2006. Computer Network Time Synchronization, The Network Time Protocol. Taylor & Francis Group, London. Google Scholar
Digital Library
- Dumitru Potop-Butucaru, Benoît Caillaud, and Albert Benveniste. 2004. Concurrency in synchronous systems. In ACSD’04. 67--78. Google Scholar
Digital Library
- Stavros Tripakis, Claudio Pinello, Albert Benveniste, Alberto L. Sangiovanni-Vincent, Paul Caspi, and Marco Di Natale. 2008. Implementing synchronous models on loosely time-triggered architectures. IEEE Trans. Comput. 57, 10 (2008), 1300--1314. Google Scholar
Digital Library
Index Terms
Loosely Time-Triggered Architectures: Improvements and Comparisons
Recommendations
Loosely time-triggered architectures: improvements and comparisons
EMSOFT '15: Proceedings of the 12th International Conference on Embedded SoftwareLoosely Time-Triggered Architectures (LTTAs) are a proposal for constructing distributed embedded control systems. They build on the quasi-periodic architecture, where computing units execute 'almost periodically', by adding a thin layer of middleware ...
Loosely time-triggered architectures for cyber-physical systems
DATE '10: Proceedings of the Conference on Design, Automation and Test in EuropeCyber-Physical Systems require distributed architectures to support safety critical real-time control. Kopetz' Time-Triggered Architectures (TTA) have been proposed as both an architecture and a comprehensive paradigm for systems architecture, for such ...
Loosely time-triggered architectures based on communication-by-sampling
EMSOFT '07: Proceedings of the 7th ACM & IEEE international conference on Embedded softwareWe address the problem of mapping a set of processes which communicate synchronously on a distributed platform. The Time Triggered Architecture (TTA) proposed by Kopetz for the communication mechanism of a distributed platform offers a direct mapping ...






Comments