DocumentCode :
2834746
Title :
The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
Author :
Baruah, S. ; Bonifaci, V. ; D´Angelo, G. ; Li, H. ; Marchetti-Spaccamela, A. ; van der Ster, S. ; Stougie, L.
fYear :
2012
fDate :
11-13 July 2012
Firstpage :
145
Lastpage :
154
Abstract :
Systems in many safety-critical application domains are subject to certification requirements. For any given system, however, it may be the case that only a subset of its functionality is safety-critical and hence subject to certification, the rest of the functionality is non safety critical and does not need to be certified, or is certified to a lower level of assurance. An algorithm called EDF-VD (for Earliest Deadline First with Virtual Deadlines) is described for the scheduling of such mixed-criticality task systems. Analyses of EDF-VD significantly superior to previously-known ones are presented, based on metrics such as processor speedup factor (EDF-VD is proved to be optimal with respect to this metric) and utilization bounds.
Keywords :
certification; processor scheduling; safety-critical software; EDF-VD algorithm; certification requirement; earliest deadline first with virtual deadline; mixed-criticality implicit-deadline sporadic task system; preemptive uniprocessor scheduling; processor speedup factor; safety-critical application domain; utilization bound; Algorithm design and analysis; Complexity theory; Processor scheduling; Real time systems; Schedules; Scheduling; Upper bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on
Conference_Location :
Pisa
ISSN :
1068-3070
Print_ISBN :
978-1-4673-2032-0
Type :
conf
DOI :
10.1109/ECRTS.2012.42
Filename :
6257567
Link To Document :
بازگشت