Monoprocessor Real-Time Scheduling of Data Dependent Tasks with Exact Preemption Cost for Embedded Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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

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.
Fichier principal
Vignette du fichier
Monoprocessor_Real-Time_Scheduling_of_Data_Dependent_Tasks_with_Exact_Preemption_Cost_for_Embedded_Systems.pdf (394.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00930224 , version 1 (14-01-2014)

Identifiers

  • HAL Id : hal-00930224 , version 1

Cite

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⟩
215 View
275 Download

Share

Gmail Facebook Twitter LinkedIn More