A unifying view of loosely time-triggered architectures

Albert Benveniste (1) , Anne Bouillard (2, 3, 4) , Paul Caspi (5)

1 DISTRIBCOM - Distributed and Iterative Algorithms for the Management of Telecommunications Systems
2 DI-ENS - Département d'informatique - ENS Paris
3 TREC - Theory of networks and communications
4 LINCS - Laboratory of Information, Network and Communication Sciences
5 VERIMAG - IMAG - VERIMAG

Cyber-Physical Systems require distributed architectures to support safety critical real-time control. Hermann Kopetz' Time-Triggered Architectures (TTA) have been proposed as both an architecture and a comprehensive paradigm for systems architecture, for such systems. To relax the strict requirements on synchronization imposed by TTA, Loosely Time-Triggered Architectures (LTTA) have been recently proposed. In LTTA, computation and communication units at all triggered by autonomous, non synchronized, clocks. Communication media act as shared memories between writers and readers and communication is non blocking. In this paper we pursue our previous work by providing a unified presentation of the two variants of LTTA (token-and time-based), with simplified analyses. We compare these two variants regarding performance and robustness and we provide ways to combine them.

Keywords: Modeling of computer architecture; Time-Triggered Architecture; Elastic Circuits; Loosely Time-Triggered Architecture

Domains: Discrete Mathematics [cs.DM]

Albert Benveniste, Anne Bouillard, Paul Caspi. A unifying view of loosely time-triggered architectures. EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software , Oct 2010, Scottsdale, Arizona, United States. pp.189 - 198, ⟨10.1145/1879021.1879047⟩. ⟨hal-01583734⟩