학술논문

The Preemptive Uniprocessor Scheduling of Mixed-Criticality Implicit-Deadline Sporadic Task Systems
Document Type
Conference
Source
2012 24th Euromicro Conference on Real-Time Systems Real-Time Systems (ECRTS), 2012 24th Euromicro Conference on. :145-154 Jul, 2012
Subject
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Computing and Processing
Fields, Waves and Electromagnetics
Scheduling
Algorithm design and analysis
Complexity theory
Schedules
Upper bound
Real time systems
Processor scheduling
Language
ISSN
1068-3070
2377-5998
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.