Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/151448
Title: | Partial order based non-preemptive communication scheduling towards real-time networks-on-chip | Authors: | Chen, Peng Chen, Hui Zhou, Jun Liu, Di Li, Shiqing Liu, Weichen Chang, Wanli Guan, Nan |
Keywords: | Engineering::Computer science and engineering | Issue Date: | 2021 | Source: | Chen, P., Chen, H., Zhou, J., Liu, D., Li, S., Liu, W., Chang, W. & Guan, N. (2021). Partial order based non-preemptive communication scheduling towards real-time networks-on-chip. The 36th ACM/SIGAPP Symposium On Applied Computing, 145-154. https://dx.doi.org/10.1145/3412841.3441895 | Project: | Ministry of Education, Singapore (MOE2019-T2-1-071, MOE2019-T1-001-072) Nanyang Technological University, Singapore (M4082282, M4082087) |
Conference: | The 36th ACM/SIGAPP Symposium On Applied Computing | Abstract: | Due to the increasing performance requirement of cyberphysical systems, many-core processors with high parallelism are gaining wide utilization, where network-on-chip (NoC) is a prevalent choice for inter-core communication. Unfortunately, the contention on NoCs introduces large timing uncertainties, which complicates the response time estimation. To address this problem, for real-time applications modeled as a directed acyclic graph (DAG), we introduce DAG-Order, a partial order based time-predictable scheduling paradigm, resulting in real-time NoCs. Specifically, DAG-Order is built upon an existing single-cycle long-range traversal (SLT) NoC that is to simplify the process of validation and verification. Then, DAG-Order is proposed based on a dynamic scheduling approach, which jointly considers communication as well as computation workloads, and matches SLT NoC. DAGOrder achieves provably bound safety by enforcing certain partial order constraints among edges/vertices that eliminate the execution-timing anomaly during the runtime phase. Finally, an effective algorithm exploring for a proper schedule order is deployed to tighten the upper bound. Experimental results demonstrate that DAG-Order performs better than state-of-the-art scheduling approaches. | URI: | https://hdl.handle.net/10356/151448 | DOI: | 10.1145/3412841.3441895 | Schools: | School of Computer Science and Engineering | Rights: | © 2021 Association for Computing Machinery (ACM). All rights reserved. This paper was published in The 36th ACM/SIGAPP Symposium On Applied Computing and is made available with permission of Association for Computing Machinery (ACM). | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
Appears in Collections: | SCSE Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Partial order based non-preemptive communication scheduling towards real-time networks-on-chip.pdf | 237.24 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
50
4
Updated on Mar 27, 2024
Page view(s)
336
Updated on Mar 27, 2024
Download(s) 50
141
Updated on Mar 27, 2024
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.