Analysis of distributed multi-periodic systems to achieve consistent data matching - Université Toulouse 1 Capitole Accéder directement au contenu
Article Dans Une Revue Concurrency and Computation: Practice and Experience Année : 2013

Analysis of distributed multi-periodic systems to achieve consistent data matching

Résumé

Distributed real-time architecture of an embedded system is often described as a set of communicating components. Such a system is data flow (for its description) and time-triggered (for its execution). This work fits in with these problematics and focuses on the control of the time compatibility of a set of interdependent data used by the system components. The architecture of a component-based system forms a graph of communicating components, where more than one path can link two components. These paths may have different timing characteristics but the flows of information which transit on these paths may need to be adequately matched, so that a component uses inputs which all (directly or indirectly) depend on the same production step. In this paper, we define this temporal datamatching property, we show how to analyze the architecture to detect situations that cause data matching inconsistencies, and we describe an approach to manage data matching that uses queues to delay too fast paths and timestamps to recognize consistent data.
Fichier principal
Vignette du fichier
Pontisso_12313.pdf (269.62 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01130800 , version 1 (12-03-2015)

Identifiants

Citer

Nadège Pontisso, Philippe Quéinnec, Gérard Padiou. Analysis of distributed multi-periodic systems to achieve consistent data matching. Concurrency and Computation: Practice and Experience, 2013, vol. 25 (n° 2), pp. 234-249. ⟨10.1002/cpe.2803⟩. ⟨hal-01130800⟩
111 Consultations
116 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More