论文标题
在多处理器系统中使用多个关键部分的实时任务安排
Scheduling of Real-Time Tasks with Multiple Critical Sections in Multiprocessor Systems
论文作者
论文摘要
多处理器同步和锁定协议的性能是在实时约束下利用多处理器系统的计算能力的关键因素。尽管在过去几十年中已经开发了多个协议，但它们的性能在很大程度上取决于任务分区和优先级。最近提出的依赖图方法显示出其优势，并引起了很多兴趣。但是，它仅限于任务集，每个任务最多具有一个关键部分。在本文中，我们删除了此限制，并演示了如何利用经典作业商店调度问题的算法来为具有多个关键部分的任务构建依赖关系图。为了显示适用性，我们讨论了Litmus^{rt}中的实现，并报告间接费用。此外，我们在不同的配置下提供了广泛的数值评估，在许多情况下，与最先进的情况相比，这些评估都显示出显着改善。
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.
