| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
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.
Cited literature [8 references]
https://hal.inria.fr/hal-00643987
Contributor : Gianlorenzo d'Angelo <>
Submitted on : Wednesday, November 23, 2011 - 1:55:30 PM
Last modification on : Monday, October 12, 2020 - 10:30:20 AM
Long-term archiving on: : Friday, February 24, 2012 - 2:25:48 AM
Contributor : Gianlorenzo d'Angelo <>
Submitted on : Wednesday, November 23, 2011 - 1:55:30 PM
Last modification on : Monday, October 12, 2020 - 10:30:20 AM
Long-term archiving on: : Friday, February 24, 2012 - 2:25:48 AM
File
MixedTasks.pdf
Files produced by the author(s)