Computing latency of a real-time system modeled by Synchronous Dataflow Graph

Abstract : Mixed applications that gather real-time tasks and best effort jobs require a research effort in order to be effectively modeled and executed. Therefore, in this study we define a general and intuitive communication model between multi-periodic real-time tasks. We first demonstrate that the communications between real-time tasks can be directly expressed as a " Synchronous Data-flow Graph ". This model-ing allows precise definition of the system latency. Accordingly , we develop an exact evaluation method to calculate the worst case latency of a system from a given input to a connected outcome. Then, we frame this value using two algorithms that compute its upper and lower bounds. Finally, we show that these bounds can be computed using a polynomial amount of computation time, while the time required to compute the exact value increases linearly according to the average repetition factor. Furthermore, the gap between the exact result and its upper (resp. lower) bound is evaluated between 10 and 15 % (resp. 20 and 30%).
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01449892
Contributor : Enagnon Klikpo <>
Submitted on : Monday, January 30, 2017 - 5:54:39 PM
Last modification on : Thursday, March 21, 2019 - 1:13:06 PM

Identifiers

Citation

Jad Khatib, Alix Munier-Kordon, Enagnon Klikpo, Trabelsi-Colibet Kods. Computing latency of a real-time system modeled by Synchronous Dataflow Graph. Real-Time Networks and Systems RTNS, Oct 2016, Brest, France. pp.87 - 96, ⟨10.1145/2997465.2997479⟩. ⟨hal-01449892⟩

Share

Metrics

Record views

253