Mixed-Criticality Scheduling of Sporadic Task Systems

Sanjoy K. Baruah (1) , Vincenzo Bonifaci (2) , Gianlorenzo d'Angelo (3, 4) , Alberto Marchetti-Spaccamela (5) , Suzanne van Der Ster (6) , Leen Stougie (7)

1 Department of Computer Science [Chapel Hill]
2 MPII - Max-Planck-Institut für Informatik
3 UNIVAQ - University of L'Aquila [Italy]
4 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
5 DIS - Dipartimento di Informatica e Sistemistica "Antonio Ruberti"
6 VU - Vrije Universiteit Amsterdam [Amsterdam]
7 Department of mathematics and computing science [Eindhoven]

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.

Domaines: Algorithme et structure de données [cs.DS]

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⟩