Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/145502
Title: | Contention minimized bypassing in SMART NoC | Authors: | Chen, Peng Liu, Weichen Li, Mengquan Yang, Lei Guan, Nan |
Keywords: | Engineering::Computer science and engineering | Issue Date: | 2020 | Source: | Chen, P., Liu, W., Li, M., Yang, L., & Guan, N. (2020). Contention minimized bypassing in SMART NoC. Proceedings of the Asia and South Pacific Design Automation Conference, 205-210. doi:10.1109/ASP-DAC47756.2020.9045103 | Project: | Nanyang Technological University, Singapore (M4082282, M4082087) Ministry of Education, Singapore (MOE2019-T2-1-071, MOE2019-T1-001-072) |
Abstract: | SMART, a recently proposed dynamically reconfigurable NoC, enables single-cycle long-distance communication by building single-bypass paths. However, such a single-cycle single-bypass path will be broken when contention occurs. Thus, lower-priority packets will be buffered at intermediate routers with blocking latency from higher-priority packets, and extra router-stage latency to rebuild remaining path, reducing the bypassing benefits that SMART offers. In this paper, we for the first time propose an effective routing strategy to achieve nearly contention-free bypassing in SMART NoC. Specifically, we identify two different routes for communication pairs: direct route, with which data can reach the destination in a single bypass; and indirect route, with which data can reach the destination in two bypasses via an intermediate router. If a direct route is not found, we would alternatively resort to an indirect route in advance to eliminate the blocking latency, at the cost of only one router-stage latency. Compared with the current routing, our new approach can effectively isolate conflicting communication pairs, greatly balance the traffic loads and fully utilize bypass paths. Experiments show that our approach makes 22.6% performance improvement on average in terms of communication latency. | URI: | https://hdl.handle.net/10356/145502 | ISSN: | 2153-697X | DOI: | 10.1109/ASP-DAC47756.2020.9045103 | Rights: | © 2020 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/ASP-DAC47756.2020.9045103 | Fulltext Permission: | open | Fulltext Availability: | With Fulltext |
Appears in Collections: | SCSE Conference Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Contention minimized bypassing in SMART NoC.pdf | 184.67 kB | Adobe PDF | View/Open |
SCOPUSTM
Citations
50
5
Updated on Feb 2, 2023
Page view(s)
242
Updated on Feb 2, 2023
Download(s) 50
100
Updated on Feb 2, 2023
Google ScholarTM
Check
Altmetric
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.