Monoprocessor Real-Time Scheduling of Data Dependent Tasks with Exact Preemption Cost for Embedded Systems

Falou Ndoye 1 Yves Sorel 1
1 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 : Most safety critical embedded systems, i.e. systems for which constraints must necessarily be satisfied in order to avoid catastrophic consequences, consist of a set of data dependent tasks which exchange data. Although non-preemptive realtime scheduling is safer than preemptive real-time scheduling in a safety critical context, preemptive real-time scheduling provides a better success ratio, but the preemption has a cost. In this paper we propose a schedulability analysis for data dependent periodic tasks which takes into account the exact preemption cost, data dependence constraints without loss of data and mutual exclusion constraints.
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00930224
Contributor : Falou Ndoye <>
Submitted on : Tuesday, January 14, 2014 - 2:47:22 PM
Last modification on : Monday, November 5, 2018 - 3:36:03 PM
Long-term archiving on : Saturday, April 8, 2017 - 3:12:53 PM

File

Monoprocessor_Real-Time_Schedu...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00930224, version 1

Collections

Citation

Falou Ndoye, Yves Sorel. Monoprocessor Real-Time Scheduling of Data Dependent Tasks with Exact Preemption Cost for Embedded Systems. ICSE'2013 16th IEEE International Conference on Computational Science and Engineering, Dec 2013, Sydney, Australia. ⟨hal-00930224⟩

Share

Metrics

Record views

395

Files downloads

264