Precise Mixed-Criticality Scheduling on Varying-Speed Multiprocessors
Precise Mixed-Criticality Scheduling on Varying-Speed Multiprocessors
复制标题
DOI：
10.1109/tc.2022.3197078
复制
发表时间：
2023-01
影响因子：
3.7
通讯作者：
Sudharsan Vaidhun;Tianning She;Qijun Gu;Sajal K. Das;Kecheng Yang;Zhishan Guo
中科院分区：
文献类型：
--
作者：
Sudharsan Vaidhun;Tianning She;Qijun Gu;Sajal K. Das;Kecheng Yang;Zhishan Guo
传统的实时系统分析需要单一的悲观估计来表示系统参数，而混合关键度（MC）设计建议使用具有不同悲观程度的系统参数的多个估计，从而导致在运行时牺牲低关键工作负载，以便为高关键工作负载提供保证。MC设计的缺点最近得到了改善，通过精确的MC调度技术，其中处理器速度在运行时增加，以提供保证，以低和高的关键工作负载。为了将精确MC调度扩展到多处理器计算平台，提出了三种基于虚拟截止期和流调度的精确MC调度算法。我们证明了我们所提出的算法的正确性，通过可扩展性分析，并通过加速比界和近似因子的计算，也提出了他们的理论有效性。最后，我们通过随机生成的任务集实验评估其性能，并证明流体调度算法优于虚拟截止日期算法。
While traditional real-time systems analysis requires single pessimistic estimates to represent system parameters, the mixed-criticality (MC) design proposes to use multiple estimates of system parameters with different levels of pessimism, resulting in low critical workloads sacrificed at run-time in order to provide guarantees to high critical workloads. Shortcomings of the MC design were improved recently by the precise MC scheduling technique in which the processor speed is increased at run-time to provide guarantees to both low and high critical workloads. Aiming to extend the precise MC scheduling to multiprocessor computing platforms, this paper proposes three novel scheduling algorithms that are based on virtual-deadline and fluid-scheduling approaches. We prove the correctness of our proposed algorithms through schedulability analysis and also present their theoretical effectiveness via speedup bounds and approximation factor calculations. Finally, we evaluate their performance experimentally via randomly generated task sets and demonstrate that the fluid-scheduling algorithms outperform the virtual-deadline algorithm.