Evaluation of the Age Latency of a Real-Time Communicating System Using the LET Paradigm

Automotive and avionics embedded systems are usually composed of several tasks that are subject to complex timing constraints. In this context, the LET paradigm was introduced to improve the determinism of a system of tasks that communicate data through shared variables. The age latency corresponds to the maximum time for the propagation of data in these systems. Its precise evaluation is an important and challenging question for the design of these systems. We consider in this paper a set of multi-periodic tasks that communicate data following the LET paradigm. Our main contribution is the development of mathematical and algorithmic tools to model precisely the dependency between tasks executions to experiment with an original methodology for computing the age latency of the system. These tools allow to handle the whole graph instead of particular chains and to extract automatically the critical parts of the graph. Experiments on randomly generated graphs indicate that systems with up to 90 periodic tasks and a hyperperiod bounded by 100 can be handled within a reasonable amount of time. 2012 ACM Subject Classification Computer systems organization → Real-time systems

[1]  Marko Bertogna,et al.  Analytical Characterization of End-to-End Communication Delays With Logical Execution Time , 2018, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[2]  Thomas A. Henzinger,et al.  Giotto: a time-triggered language for embedded programming , 2001, Proc. IEEE.

[3]  Ana Sokolova,et al.  The Logical Execution Time Paradigm , 2012, Advances in Real-Time Systems.

[4]  Frédéric Boniol,et al.  End-to-end latency computation in a multi-periodic design , 2013, SAC '13.

[5]  Claire Pagetti,et al.  The ROSACE case study: From Simulink specification to multi/many-core execution , 2014, 2014 IEEE 19th Real-Time and Embedded Technology and Applications Symposium (RTAS).

[6]  Benoît Dupont de Dinechin,et al.  K-Periodic schedules for evaluating the maximum throughput of a Synchronous Dataflow graph , 2012, 2012 International Conference on Embedded Computer Systems (SAMOS).

[7]  Thomas A. Henzinger,et al.  From control models to real-time code using Giotto , 2003 .

[8]  Nico Feiertag,et al.  A Compositional Framework for End-to-End Path Delay Calculation of Automotive Systems under Different Path Semantics , 2008, RTSS 2009.

[9]  Alix Munier Kordon,et al.  Computing latency of a real-time system modeled by Synchronous Dataflow Graph , 2016, RTNS '16.

[10]  Elibertus de Groote,et al.  On the analysis of synchronous dataflow graphs: a system-theoretic perspective , 2016 .

[11]  Thomas Nolte,et al.  Synthesizing Job-Level Dependencies for Automotive Multi-rate Effect Chains , 2016, 2016 IEEE 22nd International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA).

[12]  Dakshina Dasari,et al.  Communication Centric Design in Complex Automotive Embedded Systems , 2017, ECRTS.

[13]  Frédéric Boniol,et al.  Verifying end-to-end real-time constraints on multi-periodic models , 2017, 2017 22nd IEEE International Conference on Emerging Technologies and Factory Automation (ETFA).

[14]  E.A. Lee,et al.  Synchronous data flow , 1987, Proceedings of the IEEE.

[15]  Marco Di Natale,et al.  Achieving Predictable Multicore Execution of Automotive Applications Using the LET Paradigm , 2018, 2018 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS).

[16]  Frédéric Boniol,et al.  Multi-task Implementation of Multi-periodic Synchronous Programs , 2011, Discret. Event Dyn. Syst..

[17]  Benoît Dupont de Dinechin,et al.  Optimal and fast throughput evaluation of CSDF , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[18]  Qing Li,et al.  Real-Time Concepts for Embedded Systems , 2003 .

[19]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.