Mixed-Criticality Scheduling of Sporadic Task Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Mixed-Criticality Scheduling of Sporadic Task Systems

Abstract

We consider the scheduling of mixed-criticality task systems, that is, systems where each task to be scheduled has multiple levels of worst-case execution time estimates. We design a scheduling algorithm, EDF-VD, whose effectiveness we analyze using the processor speedup metric: we show that any 2-level task system that is schedulable on a unit-speed processor is correctly scheduled by EDF-VD using speed φ; here φ < 1.619 is the golden ratio. We also show how to generalize the algorithm to K > 2 criticality levels.We finally consider 2-level instances on m identical machines. We prove speedup bounds for scheduling an independent collection of jobs and for the partitioned scheduling of a 2-level task system.
Fichier principal
Vignette du fichier
MixedTasks.pdf (310.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00643987 , version 1 (23-11-2011)

Identifiers

Cite

Sanjoy K. Baruah, Vincenzo Bonifaci, Gianlorenzo d'Angelo, Alberto Marchetti-Spaccamela, Suzanne van Der Ster, et al.. Mixed-Criticality Scheduling of Sporadic Task Systems. 19th Annual European Symposium on Algorithms (ESA 2011), Sep 2011, Saarbruecken, Germany. pp.555-566, ⟨10.1007/978-3-642-23719-5_47⟩. ⟨hal-00643987⟩
241 View
826 Download

Altmetric

Share

Gmail Facebook X LinkedIn More