当前位置: X-MOL 学术arXiv.cs.OS › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems
arXiv - CS - Operating Systems Pub Date : 2020-07-16 , DOI: arxiv-2007.08302
Jian-Jia Chen, Junjie Shi, Georg von der Br\"uggen, Niklas Ueter

The performance of multiprocessor synchronization and locking protocols is a key factor to utilize the computation power of multiprocessor systems under real-time constraints. While multiple protocols have been developed in the past decades, their performance highly depends on the task partition and prioritization. The recently proposed Dependency Graph Approach showed its advantages and attracted a lot of interest. It is, however, restricted to task sets where each task has at most one critical section. In this paper, we remove this restriction and demonstrate how to utilize algorithms for the classical job shop scheduling problem to construct a dependency graph for tasks with multiple critical sections. To show the applicability, we discuss the implementation in Litmus^{RT} and report the overheads. Moreover, we provide extensive numerical evaluations under different configurations, which in many situations show significant improvement compared to the state-of-the-art.

中文翻译:

多处理器系统中具有多个关键部分的实时任务调度

多处理器同步和锁定协议的性能是在实时约束下利用多处理器系统计算能力的关键因素。虽然在过去几十年中开发了多种协议,但它们的性能在很大程度上取决于任务划分和优先级。最近提出的依赖图方法显示了它的优势并引起了很多兴趣。但是,它仅限于每个任务最多有一个临界区的任务集。在本文中,我们消除了这一限制,并演示了如何利用经典作业车间调度问题的算法为具有多个关键部分的任务构建依赖图。为了展示适用性,我们讨论了 Litmus^{RT} 中的实现并报告了开销。而且,
更新日期:2020-07-17
down
wechat
bug