Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate
The scheduling of mixed-criticality (MC) systems with graceful degradation is considered, where LO-criticality tasks are guaranteed some service in HI mode in the form of minimum cumulative completion rates. First, we present an easy to implement admission-control procedure to determine which LO-criticality jobs to complete in HI mode. Then, we propose a demand-bound-function-based MC schedulability test that runs in pseudo-polynomial time for such systems under EDF-VD scheduling, wherein two virtual deadline setting heuristics are considered. Furthermore, we discuss a mechanism for the system to switch back from HI to LO mode and quantify the maximum time duration such recovery process would take. Finally, we show the effectiveness of our proposed method by experimental evaluation in comparison to state-of-the-art MC schedulers.
Z. Guo et al., "Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate," Proceedings of the 2018 IEEE Real-Time Systems Symposium (2018, Nashville, TN), pp. 373-383, Institute of Electrical and Electronics Engineers (IEEE), Dec 2018.
The definitive version is available at https://doi.org/10.1109/RTSS.2018.00052
2018 IEEE Real-Time Systems Symposium, RTSS 2018 (2018: Dec. 11-14, Nashville, TN)
Intelligent Systems Center
Keywords and Phrases
Criticality (nuclear fission); Interactive computer systems; Polynomial approximation; Response time (computer systems); Scheduling; EDF-GVD; Experimental evaluation; Graceful degradation; Mixed criticalities; Recovery process; Schedulability test; State of the art; Uniprocessors; Real time systems
International Standard Book Number (ISBN)
International Standard Serial Number (ISSN)
Article - Conference proceedings
© 2018 Institute of Electrical and Electronics Engineers (IEEE), All rights reserved.