Periodic real-time scheduling: from deadline-based model to latency-based model

Liliana Cucu 1 Nicolas Pernet 2 Yves Sorel 2
1 TRIO - Real time and interoperability
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Paris-Rocquencourt, Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : This paper presents a connection between two real-time models: a deadline-based model and a latency-based model. The importance of the latency-based model is proved through a result showing that two deadlines, instead of a latency constraint, over-constrain the real-time applications. Moreover, we give a deadline-marking algorithm based on the relation between deadlines and latency constraints. This algorithm provides non-preemptive feasible schedules for systems with precedence constraints and deadlines, or more complex systems with deadlines and latencies. This is the first step toward non-preemptive schedulability for distributed architectures (without over-constraining the system) like, for example, the automotive applications using protocols such as Controller Area Network (CAN).
Document type :
Journal articles
Liste complète des métadonnées
Contributor : Liliana Cucu-Grosjean <>
Submitted on : Tuesday, November 27, 2007 - 11:06:06 AM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM


  • HAL Id : inria-00192221, version 1


Liliana Cucu, Nicolas Pernet, Yves Sorel. Periodic real-time scheduling: from deadline-based model to latency-based model. Annals of Operations Research, Springer Verlag, 2008, 159 (1), pp.41-51. ⟨inria-00192221⟩



Record views