Periodic real-time scheduling: from deadline-based model to latency-based model - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2008

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

(1) , (2) , (2)
1
2

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).
Not file

Dates and versions

inria-00192221 , version 1 (27-11-2007)

Identifiers

Cite

Liliana Cucu, Nicolas Pernet, Yves Sorel. Periodic real-time scheduling: from deadline-based model to latency-based model. Annals of Operations Research, 2008, 159 (1), pp.41-51. ⟨10.1007/s10479-007-0279-9⟩. ⟨inria-00192221⟩
117 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More