Outstanding Paper Award: Global Mixed-Criticality Scheduling on Multiprocessors

Abstract

The scheduling of mixed-criticality implicit-deadline sporadic task systems on identical multiprocessor platforms is considered, when inter-processor migration is permitted. A scheduling algorithm is derived and proved correct, and its properties investigated. Theoretical analysis (in the form of both a speedup factor and sufficient schedulability conditions) as well as extensive simulation experiments serve to demonstrate its effectiveness.