End-to-end latency computation in a multi-periodic design

Wyss, Rémy; Boniol, Frédéric; Pagetti, Claire; Forget, Julien

doi:10.1145/2480362.2480678

Cited by 9 publications

(4 citation statements)

References 10 publications

(19 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Abstract models. Wyss et al [63,64] present an analysis of the end-to-end latencies for a formal language with synchronous semantics named Prelude [23,50]. The data propagation in a functional chain is expressed by "a data dependency word" [24,50].…”

Section: Related Workmentioning

confidence: 99%

Latency upper bound for data chains of real-time periodic tasks

Kloda

Bertout

Sorel

2020

Journal of Systems Architecture

View full text Add to dashboard Cite

The inter-task communication in embedded real-time systems can be achieved using various patterns and be subject to different timing constraints. One of the most basic communication patterns encountered in today's automotive and aerospace software is the data chain. Each task of the chain reads data from the previous task and delivers the results of its computation to the next task. The data passing does not affect the execution of the tasks that are activated periodically at their own rates. As there is no task synchronization, a task does not wait for its predecessor data; it may execute with old data and get new data at its later release. From the design stage of embedded real-time systems, evaluating if data chains meet their timing requirements, such as the latency constraint, is of the highest importance. The trade-off between accuracy and complexity of the timing analysis is a critical element in the optimization process. In this paper, we consider data chains of real-time periodic tasks executed by a fixed-priority preemptive scheduler upon a single processor. We present a method for the worst-case latency calculation of periodic tasks' data chains. As the method has an exponential time complexity, we derive a polynomial-time upper bound. Evaluations carried out on an automotive benchmark demonstrate that the average bound overestimation is less than 10 percent of the actual value.

show abstract

Section: Related Workmentioning

confidence: 99%

Latency upper bound for data chains of real-time periodic tasks

Kloda

Bertout

Sorel

2020

Journal of Systems Architecture

View full text Add to dashboard Cite

show abstract

“…Wyss et al [5], [14] present an analysis of the end-to-end latencies for a formal language with synchronous semantics Prelude [15]. The data propagation in functional chain is expressed by a data dependency word [16].…”

Section: Related Workmentioning

confidence: 99%

Latency analysis for data chains of real-time periodic tasks

Kloda

Bertout

Sorel

2018

2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)

View full text Add to dashboard Cite

A data chain is a sequence of periodic realtime communicating tasks that are processing the data from sensors up to actuators. It determines an order in which the tasks propagate data but not in which they are executed: inter-task communication and scheduling are independent. In this paper, we focus on the latency computation, considered as the time elapsed from getting the data from an input and processing it to an output of a data chain. We propose a method for the worst-case latency calculation of periodic tasks' data chains executed by a partitioned fixed-priority preemptive scheduler upon a multiprocessor platform. As far as we know, there is no such formal approach based on closed-form expression for communicating real-time tasks.

show abstract

“…In [17], authors proposed an end-to-end properties analysis that is performed at the model level, which abstracts from scheduling details, but still with register buffer communication. End-to-end latency analysis for systems with causal communications has been studied in [18][19][20][21]. Our work provides a more general analysis method for arbitrary end-to-end properties (not only latency).…”

Section: Related Workmentioning

confidence: 99%

Verifying end-to-end real-time constraints on multi-periodic models

Forget

Boniol

Pagetti

2017

2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA)

Self Cite

View full text Add to dashboard Cite

To cite this version:Julien Forget, Frédéric Boniol, Claire Pagetti. Verifying end-to-end real-time constraints on multiperiodic models. ETFA2017 -22nd IEEE International Conference on Emerging Technologies And Factory Automation, Sep 2017, Limassol, Cyprus. Verifying end-to-end real-time constraints on multi-periodic models AbstractControl-command systems must usually satisfy a set of high-level end-to-end timing constraints to ensure their correctness. We propose a formal approach to verify these properties directly at the model level. First, we introduce a small language for specifying arbitrary end-to-end constraints. Then, we show how to verify any constraint of this language for a system represented with a multi-periodic synchronous model, a model that retains the main concepts of data-flow oriented programming languages (such as Matlab/Simulink, synchronous languages or AADL). One advantage of this approach is that it is simpler to verify end-to-end constraints at the model level, early in the development process, rather than at the implementation level.

show abstract

End-to-end latency computation in a multi-periodic design

Cited by 9 publications

References 10 publications

Latency upper bound for data chains of real-time periodic tasks

Latency upper bound for data chains of real-time periodic tasks

Latency analysis for data chains of real-time periodic tasks

Verifying end-to-end real-time constraints on multi-periodic models

Contact Info

Product

Resources

About