DOI 10.1007/s11241-013-9184-2 Mixed-criticality scheduling on multiprocessors

Abstract The scheduling of mixed-criticality implicit-deadline sporadic task sys-tems on identical multiprocessor platforms is considered. Two approaches, one for global and another for partitioned scheduling, are described. Theoretical analyses and simulation experiments are used to compare the global and partitioned schedul-ing approaches