Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/165559
Title: Contention minimization in emerging SMART NoC via direct and indirect routes
Authors: Chen, Peng
Chen, Hui
Zhou, Jun
Li, Mengquan
Liu, Weichen
Xiao, Chunhua
Xie, Yiyuan
Guan, Nan
Keywords: Engineering::Computer science and engineering::Hardware::Input/output and data communications
Issue Date: 2022
Source: 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
Project: MoE2019-T2-1-071 
MoE2019-T1-001-072 
M4082282 
M4082087 
Journal: IEEE Transactions on Computers 
Abstract: 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.
URI: https://hdl.handle.net/10356/165559
ISSN: 1557-9956
DOI: 10.1109/TC.2021.3111517
DOI (Related Dataset): 10.21979/N9/JGBX4G
Schools: School of Computer Science and Engineering 
Rights: © 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.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
Contention_Minimization_in_Emerging_SMART_NoC_via_Direct_and_Indirect_Routes.pdf3.23 MBAdobe PDFThumbnail
View/Open

SCOPUSTM   
Citations 50

3
Updated on Apr 11, 2024

Web of ScienceTM
Citations 50

1
Updated on Oct 27, 2023

Page view(s)

118
Updated on Apr 18, 2024

Download(s) 50

64
Updated on Apr 18, 2024

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.