Contention minimization in emerging SMART NoC via direct and indirect routes
SMART (Single-cycle Multi-hop Asynchronous Repeated Traversal) Network-on-Chip (NoC), a recently proposed dynamically reconfigurable NoC, enables single-cycle long-distance communication by building single-bypass paths directly between distant communication pairs. However, such a single-cycle single...
Saved in:
Main Authors: | , , , , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2023
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/165559 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-165559 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1655592023-03-31T15:51:32Z Contention minimization in emerging SMART NoC via direct and indirect routes Chen, Peng Chen, Hui Zhou, Jun Li, Mengquan Liu, Weichen Xiao, Chunhua Xie, Yiyuan Guan, Nan School of Computer Science and Engineering Engineering::Computer science and engineering::Hardware::Input/output and data communications Minimisation Network Routing SMART (Single-cycle Multi-hop Asynchronous Repeated Traversal) Network-on-Chip (NoC), a recently proposed dynamically reconfigurable NoC, enables single-cycle long-distance communication by building single-bypass paths directly between distant communication pairs. However, such a single-cycle single-bypass path will be readily broken when contention occurs. Thus, packets will be buffered at intermediate routers with blocking latency from other contending packets, and extra router-stage latency to rebuild the remaining path when available, reducing the bypassing benefits that SMART NoC offers. In this article, we for the first time propose an effective contention-minimized routing algorithm to achieve maximal bypassing in SMART NoCs. Specifically, we identify two potential routes for packets: direct route, with which packets can reach the destination in a single bypass; and indirect route, with which packets can reach the destination in multiple bypasses via a (multiple) intermediate router(s). The novel feature of the proposed routing strategy is that, contrary to an intuitive approach, not the routes with minimal distance but the indirect routes via the arbitrary intermediate routers (even if they may be non-minimal) that avoid contentions yield the minimized end-to-end latency. Our new routing strategy can greatly enrich the path diversity, effectively minimize the conflicts between communication pairs, greatly balance the workloads and fully utilize bypass paths. Evaluation on realistic benchmarks demonstrates the effectiveness of the proposed routing strategy, which achieves average performance improvement by 35.48 percent in communication latency, 28.31 percent in application schedule length, and 37.59 percent in network throughput, compared with the current routing in SMART NoCs. Ministry of Education (MOE) Nanyang Technological University Submitted/Accepted version This work is partially supported by the Ministry of Education, Singapore, under its Academic Research Fund Tier 2 (MoE2019-T2-1-071) and Tier 1 (MoE2019-T1-001-072), and NTU, Singapore, under its NAP (M4082282) and SUG (M4082087). 2023-03-30T07:39:43Z 2023-03-30T07:39:43Z 2022 Journal Article Chen, P., Chen, H., Zhou, J., Li, M., Liu, W., Xiao, C., Xie, Y. & Guan, N. (2022). Contention minimization in emerging SMART NoC via direct and indirect routes. IEEE Transactions On Computers, 71(8), 1874-1888. https://dx.doi.org/10.1109/TC.2021.3111517 1557-9956 https://hdl.handle.net/10356/165559 10.1109/TC.2021.3111517 2-s2.0-85114731557 8 71 1874 1888 en MoE2019-T2-1-071 MoE2019-T1-001-072 M4082282 M4082087 IEEE Transactions on Computers 10.21979/N9/JGBX4G © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TC.2021.3111517. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering::Hardware::Input/output and data communications Minimisation Network Routing |
spellingShingle |
Engineering::Computer science and engineering::Hardware::Input/output and data communications Minimisation Network Routing Chen, Peng Chen, Hui Zhou, Jun Li, Mengquan Liu, Weichen Xiao, Chunhua Xie, Yiyuan Guan, Nan Contention minimization in emerging SMART NoC via direct and indirect routes |
description |
SMART (Single-cycle Multi-hop Asynchronous Repeated Traversal) Network-on-Chip (NoC), a recently proposed dynamically reconfigurable NoC, enables single-cycle long-distance communication by building single-bypass paths directly between distant communication pairs. However, such a single-cycle single-bypass path will be readily broken when contention occurs. Thus, packets will be buffered at intermediate routers with blocking latency from other contending packets, and extra router-stage latency to rebuild the remaining path when available, reducing the bypassing benefits that SMART NoC offers. In this article, we for the first time propose an effective contention-minimized routing algorithm to achieve maximal bypassing in SMART NoCs. Specifically, we identify two potential routes for packets: direct route, with which packets can reach the destination in a single bypass; and indirect route, with which packets can reach the destination in multiple bypasses via a (multiple) intermediate router(s). The novel feature of the proposed routing strategy is that, contrary to an intuitive approach, not the routes with minimal distance but the indirect routes via the arbitrary intermediate routers (even if they may be non-minimal) that avoid contentions yield the minimized end-to-end latency. Our new routing strategy can greatly enrich the path diversity, effectively minimize the conflicts between communication pairs, greatly balance the workloads and fully utilize bypass paths. Evaluation on realistic benchmarks demonstrates the effectiveness of the proposed routing strategy, which achieves average performance improvement by 35.48 percent in communication latency, 28.31 percent in application schedule length, and 37.59 percent in network throughput, compared with the current routing in SMART NoCs. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Chen, Peng Chen, Hui Zhou, Jun Li, Mengquan Liu, Weichen Xiao, Chunhua Xie, Yiyuan Guan, Nan |
format |
Article |
author |
Chen, Peng Chen, Hui Zhou, Jun Li, Mengquan Liu, Weichen Xiao, Chunhua Xie, Yiyuan Guan, Nan |
author_sort |
Chen, Peng |
title |
Contention minimization in emerging SMART NoC via direct and indirect routes |
title_short |
Contention minimization in emerging SMART NoC via direct and indirect routes |
title_full |
Contention minimization in emerging SMART NoC via direct and indirect routes |
title_fullStr |
Contention minimization in emerging SMART NoC via direct and indirect routes |
title_full_unstemmed |
Contention minimization in emerging SMART NoC via direct and indirect routes |
title_sort |
contention minimization in emerging smart noc via direct and indirect routes |
publishDate |
2023 |
url |
https://hdl.handle.net/10356/165559 |
_version_ |
1762031120381116416 |