Affiliation:
1. School of Computer Science and Technology/School of Artificial Intelligence, Chongqing University of Posts and Telecommunications, China
2. HiSilicon Technologies Co. Ltd., China
3. Nanyang Technological University, Singapore
4. Chongqing University of Posts and Telecommunications
5. Hunan University/Huawei Technologies, China
6. City University of Hong Kong, Hong Kong SAR
Abstract
With the high-performance requirement of safety-critical real-time tasks, the platforms of many-core processors with high parallelism are widely utilized, where network-on-chip (NoC) is generally employed for inter-core communication due to its scalability and high efficiency. Unfortunately, large uncertainties are suffered on NoCs from both the overly parallel architecture and the distributed scheduling strategy (e.g., wormhole flow control), which complicates the response time upper bounds estimation (i.e., either unsafe or pessimistic). For DAG-based real-time parallel tasks, to solve this problem, we propose DAG-Order, an order-based dynamic DAG scheduling approach, which strictly guarantees NoC real-time services. First, rather than build the new analysis to fit the widely used best-effort wormhole NoC, DAG-Order is built upon a kind of advanced low-latency NoC with SLT (
S
ingle-cycle
L
ong-range
T
raversal) to avoid the unpredictable parallel transmission on the shared source-destination link of wormhole NoCs. Second, DAG-Order is a non-preemptive dynamic scheduling strategy, which jointly considers communication as well as computation workloads, and fits SLT NoC. With such an order-based dynamic scheduling strategy, the provably bound
safety
is ensured by enforcing certain order constraints among DAG edges/vertices that eliminate the execution-timing anomaly at runtime. Third, the order constraints are further relaxed for higher average-case runtime performance without compromising bound safety. Finally, an effective heuristic algorithm seeking a proper schedule order is developed to
tighten
the bounds. Experiments on synthetic and realistic benchmarks demonstrate that DAG-Order performs better than the state-of-the-art related scheduling methods.
Funder
Science and Technology Research Program of Chongqing Municipal Education Commission
Startup Grant of Chongqing University of Posts and Telecommunications
Nanyang Technological University, Singapore, under its NAP
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Information Systems,Software
Reference39 articles.
1. List scheduling algorithm for heterogeneous systems by an optimistic cost table;Arabnejad Hamid;IEEE Transactions on Parallel and Distributed Systems,2013
2. Smart-hop arbitration request propagation: Avoiding quadratic arbitration complexity and false negatives in SMART NoCs;Asgarieh Yashar;ACM Transactions on Design Automation of Electronic Systems,2019
3. Sanjoy Baruah. 2015. The federated scheduling of systems of conditional sporadic DAG tasks. In Proceedings of the 2015 International Conference on Embedded Software (EMSOFT’15). IEEE, Los Alamitos, CA, 1–10.
4. Chawki Benchehida, Mohammed Kamel Benhaoua, Houssam-Eddine Zahaf, and Giuseppe Lipari. 2020. Task and communication allocation for real-time tasks to networks-on-chip multiprocessors. In Proceedings of the 2020 2nd International Conference on Embedded and Distributed Systems (EDiS’20). IEEE, Los Alamitos, CA, 9–14.
5. Alan Burns, Leandro Soares Indrusiak, N. Smirnov, and J. Harrison. 2020. A novel flow control mechanism to avoid multi-point progressive blocking in hard real-time priority-preemptive NoCs. In Proceedings of the 2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS’20). IEEE, Los Alamitos, CA, 137–147.