research-article

Loosely Time-Triggered Architectures: Improvements and Comparisons

Authors:

Guillaume Baudart,

Albert Benveniste,

Timothy BourkeAuthors Info & Claims

ACM Transactions on Embedded Computing Systems (TECS), Volume 15, Issue 4

Article No.: 71, Pages 1 - 26

https://doi.org/10.1145/2932189

Published: 02 August 2016 Publication History

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.

References

[1]

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.

Digital Library

[2]

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}.

[3]

Albert Benveniste, Anne Bouillard, and Paul Caspi. 2010. A unifying view of loosely time-triggered architectures. In EMSOFT’10. USA, 189--198.

Digital Library

[4]

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.

Digital Library

[5]

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.

Digital Library

[6]

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.

[7]

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.

Digital Library

[8]

Timothy Bourke and Marc Pouzet. 2013. Zélus: A synchronous language with ODEs. In HSCC’13. USA, 113--118.

Digital Library

[9]

Luca P. Carloni. 2006. The role of back-pressure in implementing latency-insensitive systems. Elec. Not. Theoret. Comput. Sci. 146, 2 (2006), 61--80.

Digital Library

[10]

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.

Digital Library

[11]

Luca P. Carloni and Alberto L. Sangiovanni-Vincentelli. 2002. Coping with latency in SoC design. IEEE Micro 22, 5 (2002), 24--35.

Digital Library

[12]

Paul Caspi. 2000. The Quasi-Synchronous Approach to Distributed Control Systems. Technical Report CMA/009931. VERIMAG, Crysis Project. “The Cooking Book.”

[13]

Paul Caspi and Albert Benveniste. 2008. Time-robust discrete control over networked loosely time-triggered architectures. In CDC’08. Mexico, 3595--3600.

[14]

Paul Caspi, Alain Girault, and Daniel Pilaud. 1994. Distributing reactive systems. In PDCS’94. 101--107.

[15]

Paul Caspi, Daniel Pilaud, Nicolas Halbwachs, and John Plaice. 1987. Lustre: A declarative language for programming synchronous systems. In POPL’87. 178--188.

Digital Library

[16]

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.

Digital Library

[17]

Jordi Cortadella and Michael Kishinevsky. 2007. Synchronous elastic circuits with early evaluation and token counterflow. In DAC’07. USA, 416--419.

Digital Library

[18]

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.

Digital Library

[19]

Nicolas Halbwachs and Siwar Baghdadi. 2002. Synchronous modelling of asynchronous systems. In EMSOFT’02. France, 240--251.

Digital Library

[20]

Nicolas Halbwachs, Paul Caspi, Pascal Raymond, and Daniel Pilaud. 1991. The synchronous dataflow programming language Lustre. Proc. IEEE 79, 9 (1991), 1305--1320.

[21]

Nicolas Halbwachs and Louis Mandel. 2006. Simulation and verification of aysnchronous systems by means of a synchronous model. In ACSD’06. Finland, 3--14.

Digital Library

[22]

Gilles Kahn. 1974. The semantics of a simple language for parallel programming. In IFIP’74. Sweden, 471--475.

[23]

Hermann Kopetz. 2011. Real-Time Systems: Design Principles for Distributed Embedded Applications. Springer-Verlag, Berlin.

Digital Library

[24]

Hermann Kopetz and Günther Bauer. 2003. The time-triggered architecture. Proc. IEEE 91, 1 (2003), 112--126.

[25]

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.

[26]

Nancy A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann, San Francisco, CA.

Digital Library

[27]

Florence Maraninchi and Yann Rémond. 2001. Argos: An automaton-based synchronous language. Comput. Lang. 27, 1--3 (2001), 61--92.

Digital Library

[28]

David L. Mills. 2006. Computer Network Time Synchronization, The Network Time Protocol. Taylor & Francis Group, London.

Digital Library

[29]

Dumitru Potop-Butucaru, Benoît Caillaud, and Albert Benveniste. 2004. Concurrency in synchronous systems. In ACSD’04. 67--78.

Digital Library

[30]

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.

Digital Library

Cited By

Kenwright LRoop PAllen NLall SCaşcaval CSpalink TIzzard M(2024)Logical Synchrony Networks: A Formal Model for Deterministic DistributionIEEE Access10.1109/ACCESS.2024.341101712(80872-80883)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3411017
Bateni SLohstroh MWong HKim HLin SMenard CLee EZhu Qvon Hanxleden RStephen EBrandt J(2023)Risk and Mitigation of Nondeterminism in Distributed Cyber-Physical SystemsProceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design10.1145/3610579.3613219(1-11)Online publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1145/3610579.3613219
Bae KÖlveczky P(2023)Formal Model Engineering of Distributed CPSs Using AADL: From Behavioral AADL Models to Multirate Hybrid Synchronous AADLFormal Aspects of Component Software10.1007/978-3-031-52183-6_7(127-152)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_7
Show More Cited By

Index Terms

Loosely Time-Triggered Architectures: Improvements and Comparisons
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems

Recommendations

A unifying view of loosely time-triggered architectures
EMSOFT '10: Proceedings of the tenth ACM international conference on Embedded software

Cyber-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 software

We 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 ...
Loosely time-triggered architectures: improvements and comparisons
EMSOFT '15: Proceedings of the 12th International Conference on Embedded Software

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 'almost periodically', by adding a thin layer of middleware ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Embedded Computing Systems

ACM Transactions on Embedded Computing Systems Volume 15, Issue 4

Special Issue on ESWEEK2015 and Regular Papers

August 2016

411 pages

ISSN:1539-9087

EISSN:1558-3465

DOI:10.1145/2982215

Editor:
Sandeep K. Shukla
Indian Institute of Technology, India

Issue’s Table of Contents

Copyright © 2016 ACM.

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Journal Family

ACM Journals for the Design of Smart and Connected Systems

Publication History

Published: 02 August 2016

Accepted: 01 April 2016

Revised: 01 April 2016

Received: 01 December 2015

Published in TECS Volume 15, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
147
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Kenwright LRoop PAllen NLall SCaşcaval CSpalink TIzzard M(2024)Logical Synchrony Networks: A Formal Model for Deterministic DistributionIEEE Access10.1109/ACCESS.2024.341101712(80872-80883)Online publication date: 2024
https://doi.org/10.1109/ACCESS.2024.3411017
Bateni SLohstroh MWong HKim HLin SMenard CLee EZhu Qvon Hanxleden RStephen EBrandt J(2023)Risk and Mitigation of Nondeterminism in Distributed Cyber-Physical SystemsProceedings of the 21st ACM-IEEE International Conference on Formal Methods and Models for System Design10.1145/3610579.3613219(1-11)Online publication date: 21-Sep-2023
https://dl.acm.org/doi/10.1145/3610579.3613219
Bae KÖlveczky P(2023)Formal Model Engineering of Distributed CPSs Using AADL: From Behavioral AADL Models to Multirate Hybrid Synchronous AADLFormal Aspects of Component Software10.1007/978-3-031-52183-6_7(127-152)Online publication date: 26-Oct-2023
https://dl.acm.org/doi/10.1007/978-3-031-52183-6_7
Bae KÖlveczky P(2021)MSYNC: A Generalized Formal Design Pattern for Virtually Synchronous Multirate Cyber-physical SystemsACM Transactions on Embedded Computing Systems10.1145/347703620:5s(1-26)Online publication date: 23-Sep-2021
https://dl.acm.org/doi/10.1145/3477036
Bourke TBrun LDagand PLeroy XPouzet MRieg L(2017)A formally verified compiler for LustreACM SIGPLAN Notices10.1145/3140587.306235852:6(586-601)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3140587.3062358
Bourke TBrun LDagand PLeroy XPouzet MRieg LCohen AVechev M(2017)A formally verified compiler for LustreProceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3062341.3062358(586-601)Online publication date: 14-Jun-2017
https://dl.acm.org/doi/10.1145/3062341.3062358

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents