TY - GEN
T1 - DPCP-p: A distributed locking protocol for parallel real-time tasks
AU - Yang, Maolin
AU - Chen, Zewei
AU - Jiang, Xu
AU - Guan, Nan
AU - Lei, Hang
N1 - Funding Information:
Corresponding author: Xu Jiang Work supported by the NSFC (Grant No. 61802052) and the China Postdoctoral Science Fundation Funded Project (Grant No. 2017M612947).
Publisher Copyright:
© 2020 IEEE.
PY - 2020/7
Y1 - 2020/7
N2 - 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.
AB - 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.
KW - Locking protocols
KW - Parallel tasks
KW - Real-time scheduling
UR - http://www.scopus.com/inward/record.url?scp=85093933234&partnerID=8YFLogxK
U2 - 10.1109/DAC18072.2020.9218584
DO - 10.1109/DAC18072.2020.9218584
M3 - Conference article published in proceeding or book
AN - SCOPUS:85093933234
T3 - Proceedings - Design Automation Conference
SP - 1
EP - 6
BT - 2020 57th ACM/IEEE Design Automation Conference, DAC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 57th ACM/IEEE Design Automation Conference, DAC 2020
Y2 - 20 July 2020 through 24 July 2020
ER -