论文标题
DPCP-P：用于并行实时任务的分布式锁定协议
DPCP-p: A Distributed Locking Protocol for Parallel Real-Time Tasks
论文作者
论文摘要
实时调度和锁定协议是构建时间关键系统的基本设施。对于并行的实时任务，当并发子工作互斥共享资源的访问时，需要可预测的锁定协议。本文首次研究并行实时任务的分布式同步框架，其中任务和全球资源都被分配给指定的处理器，并且对每个全球资源的请求都在对资源分区的处理器上进行。我们将分布式优先限制协议（DPCP）扩展到联合计划下的并行任务，我们证明了请求最多可以被一个低优先级请求阻止。我们开发任务和资源分配启发式方法，并提出分析技术，以安全地限制任务响应时间。数值评估（在8-，16和32核处理器上进行重大任务）表明，与联合计划下的最新锁定协议相比，所提出的方法显着提高了计划性。
Real-time scheduling and locking protocols are fundamental facilities to construct time-critical systems. For parallel real-time tasks, predictable locking protocols are required when concurrent sub-jobs mutually exclusive access to shared resources. This paper for the first time studies the distributed synchronization framework of parallel real-time tasks, where both tasks and global resources are partitioned to designated processors, and requests to each global resource are conducted on the processor on which the resource is partitioned. We extend the Distributed Priority Ceiling Protocol (DPCP) for parallel tasks under federated scheduling, with which we proved that a request can be blocked by at most one lower-priority request. We develop task and resource partitioning heuristics and propose analysis techniques to safely bound the task response times. Numerical evaluation (with heavy tasks on 8-, 16-, and 32-core processors) indicates that the proposed methods improve the schedulability significantly compared to the state-of-the-art locking protocols under federated scheduling.
