Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate
Uniprocessor Mixed-Criticality Scheduling with Graceful Degradation by Completion Rate
复制标题
DOI：
10.1109/rtss.2018.00052
复制
发表时间：
2018-12
期刊：
影响因子：
--
通讯作者：
Zhishan Guo;Kecheng Yang;Sudharsan Vaidhun;Samsil Arefin;Sajal K. Das;Haoyi Xiong
中科院分区：
文献类型：
--
作者：
Zhishan Guo;Kecheng Yang;Sudharsan Vaidhun;Samsil Arefin;Sajal K. Das;Haoyi Xiong
考虑了具有优雅降级的混合关键性（MC）系统的调度问题，其中LO关键性任务在HI模式下以最小累积完成率的形式保证一定的服务.首先，我们提出了一个易于实现的准入控制程序，以确定在HI模式下完成哪些LO关键性作业。然后，我们提出了一个基于需求约束函数的MC可扩展性测试，运行在伪多项式时间，这样的系统下EDF-VD调度，其中两个虚拟的最后期限设置策略被认为是。此外，我们讨论了一种机制，系统切换回从HI到LO模式，并量化的最大持续时间，这样的恢复过程将采取。最后，我们展示了我们所提出的方法的有效性，通过实验评估比较，国家的最先进的MC封装。
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.