Latency analysis for data chains of real-time periodic tasks

Abstract : A data chain is a sequence of periodic real-time 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.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01939228
Contributor : Yves Sorel <>
Submitted on : Thursday, November 29, 2018 - 11:57:45 AM
Last modification on : Thursday, February 7, 2019 - 2:28:50 PM

File

latency_etfa2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01939228, version 1

Citation

Tomasz Kloda, Antoine Bertout, Yves Sorel. Latency analysis for data chains of real-time periodic tasks. ETFA'2018 - IEEE International Conference on Emerging Technologies and Factory Automation, Sep 2018, Torino, Italy. ⟨hal-01939228⟩

Share

Metrics

Record views

88

Files downloads

99