Mixed-criticality scheduling of sporadic task systems

Authors:
Sanjoy K. Baruah;Vincenzo Bonifaci;Gianlorenzo D'Angelo;Alberto Marchetti-Spaccamela;Suzanne Van Der Ster;Leen Stougie
Affiliations:
University of North Carolina at Chapel Hill;Max-Planck Institut für Informatik, Saarbrücken, Germany;University of L'Aquila, Italy;Sapienza Universitàa di Roma, Rome, Italy;Vrije Universiteit Amsterdam, The Netherlands;Vrije Universiteit Amsterdam, The Netherlands and CWI, Amsterdam, The Netherlands
Venue:
ESA'11 Proceedings of the 19th European conference on Algorithms
Year:
2011

Citing 6
Cited 4

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Speed is as powerful as clairvoyance

Journal of the ACM (JACM)
On Multidimensional Packing Problems

SIAM Journal on Computing
Towards the Design of Certifiable Mixed-criticality Systems

RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Scheduling real-time mixed-criticality jobs

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
An Algorithm for Scheduling Certifiable Mixed-Criticality Sporadic Task Systems

RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium

Two protocols to reduce the criticality level of multiprocessor mixed-criticality systems

Proceedings of the 21st International conference on Real-Time Networks and Systems
Multi-layered scheduling of mixed-criticality cyber-physical systems

Journal of Systems Architecture: the EUROMICRO Journal
Mixed-criticality scheduling on multiprocessors

Real-Time Systems
Bounding and shaping the demand of generalized mixed-criticality sporadic task systems

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

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 φ 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.