Scheduling Real-Time Mixed-Criticality Jobs

Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers Jg. 61; H. 8; S. 1140 - 1152
Hauptverfasser: Baruah, S., Bonifaci, V., D'Angelo, G., Haohan Li, Marchetti-Spaccamela, A., Megow, N., Stougie, L.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: IEEE 01.08.2012
Institute of Electrical and Electronics Engineers
Schlagworte:
certification
Computational modeling
Computer Science
Data Structures and Algorithms
Embedded systems
Mission critical systems
mixed criticality
Preemptive scheduling
Processor scheduling
Real time systems
safety-critical systems
Scheduling
Standards organizations
ISSN:0018-9340
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Many safety-critical embedded systems are subject to certification requirements; some systems may be required to meet multiple sets of certification requirements, from different certification authorities. Certification requirements in such "mixed-criticality" systems give rise to interesting scheduling problems, that cannot be satisfactorily addressed using techniques from conventional scheduling theory. In this paper, we study a formal model for representing such mixed-criticality workloads. We demonstrate first the intractability of determining whether a system specified in this model can be scheduled to meet all its certification requirements, even for systems subject to merely two sets of certification requirements. Then we quantify, via the metric of processor speedup factor, the effectiveness of two techniques, reservation-based scheduling and priority-based scheduling, that are widely used in scheduling such mixed-criticality systems, showing that the latter of the two is superior to the former. We also show that the speedup factors we obtain are tight for these two techniques.
ISSN:0018-9340
DOI:10.1109/TC.2011.142