Latency analysis for data chains of real-time periodic tasks

Tomasz Kloda (1) , Antoine Bertout (2) , Yves Sorel (3, 4)

1 UNIMORE - Università degli Studi di Modena e Reggio Emilia = University of Modena and Reggio Emilia
2 UP - Université de Poitiers = University of Poitiers
3 AOSTE2 - Models and methods of analysis and optimization for systems with real-time and embedded contraints
4 KOPERNIC - Adapter le raisonnement pire cas à différentes criticités

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.

Domaines: Systèmes embarqués

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⟩