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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.inria.fr/hal-00643987
Contributor : Gianlorenzo d'Angelo <>
Submitted on : Wednesday, November 23, 2011 - 1:55:30 PM
Last modification on : Wednesday, August 21, 2019 - 10:22:07 AM
Long-term archiving on : Friday, February 24, 2012 - 2:25:48 AM

File

MixedTasks.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sanjoy Baruah, Vincenzo Bonifaci, Gianlorenzo d'Angelo, Alberto Marchetti-Spaccamela, Suzanne 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⟩

Share

Metrics

Record views

414

Files downloads

570