Mixed-Criticality Multicore Scheduling of Real-Time Gang Task Systems

Mixed-Criticality Multicore Scheduling of Real-Time Gang Task Systems
复制标题

DOI:
10.1109/rtss46320.2019.00048
复制
发表时间:
2019-12
期刊:
2019 IEEE Real-Time Systems Symposium (RTSS)
影响因子:
--
通讯作者:
Ashikahmed Bhuiyan;Kecheng Yang;Samsil Arefin;Abusayeed Saifullah;Nan Guan;Zhishan Guo
Ashikahmed Bhuiyan;Kecheng Yang;Samsil Arefin;Abusayeed Saifullah;Nan Guan;Zhishan Guo
中科院分区:
其他
文献类型:
--
作者:
Ashikahmed Bhuiyan;Kecheng Yang;Samsil Arefin;Abusayeed Saifullah;Nan Guan;Zhishan Guo

文献摘要

被引文献

相似文献

顺序任务的混合关键度(MC)调度(没有任务内并行性)已经被实时系统社区很好地探索。然而,迄今为止,并行任务MC调度的研究进展甚微。并行任务的MC调度具有很大的挑战性,因为在不同的关键度水平下需要不同的保证。在这项工作中,我们解决了MC调度的并行任务的帮派模型,允许工作负载同时在多个核心上执行。这样的工作负载模型代表了具有许多潜在应用的高效的基于模式的并行处理方案。为了调度这样的任务集,我们提出了一种新的技术GEDF-VD,它集成了全球最早期限优先(GEDF)和最早期限优先与虚拟期限(EDF-VD)。我们证明了GEDF-VD的正确性,并提供了一个详细的定量评估方面的加速比界在MC和非MC的情况下。具体来说,我们表明,GEDF提供了一个加速约束为2的非MC帮派任务,而加速GEDF-VD考虑MC帮派任务是105 + 1。在随机生成的帮派任务集上进行了实验,以验证我们的理论发现并证明所提出方法的有效性。
Mixed-criticality (MC) scheduling of sequential tasks (with no intra-task parallelism) has been well-explored by the real-time systems community. However, till date, there has been little progress on MC scheduling of parallel tasks. MC scheduling of parallel tasks is highly challenging due to the requirement of various assurances under different criticality levels. In this work, we address the MC scheduling of parallel tasks of gang model that allows workloads to execute on multiple cores simultaneously. Such a workload model represents an efficient mode-based parallel processing scheme with many potential applications. To schedule such task sets, we propose a new technique GEDF-VD, which integrates Global Earliest Deadline First (GEDF) and Earliest Deadline First with Virtual Deadline (EDF-VD). We prove the correctness of GEDF-VD and provide a detailed quantitative evaluation in terms of speedup bound in both the MC and the non-MC cases. Specifically, we show that GEDF provides a speedup bound of 2 for non-MC gang tasks, while the speedup for GEDF-VD considering MC gang tasks is √5 + 1. Experiments on randomly generated gang task sets are conducted to validate our theoretical findings and to demonstrate the effectiveness of the proposed approach.