Contention minimized bypassing in SMART NoC
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 wi...
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Language: | English |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/145502 |
| _version_ | 1811687748517494784 |
|---|---|
| author | Chen, Peng Liu, Weichen Li, Mengquan Yang, Lei Guan, Nan |
| author2 | School of Computer Science and Engineering |
| author_facet | School of Computer Science and Engineering Chen, Peng Liu, Weichen Li, Mengquan Yang, Lei Guan, Nan |
| author_sort | Chen, Peng |
| collection | NTU |
| description | 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. |
| first_indexed | 2024-10-01T05:21:15Z |
| format | Conference Paper |
| id | ntu-10356/145502 |
| institution | Nanyang Technological University |
| language | English |
| last_indexed | 2024-10-01T05:21:15Z |
| publishDate | 2020 |
| record_format | dspace |
| spelling | ntu-10356/1455022023-12-15T07:31:02Z Contention minimized bypassing in SMART NoC Chen, Peng Liu, Weichen Li, Mengquan Yang, Lei Guan, Nan School of Computer Science and Engineering 2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC) Engineering::Computer science and engineering Network Routing Telecommunication Traffic 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. Ministry of Education (MOE) This work is partially supported by MoE AcRF Tier 2 MOE2019-T2-1-071 and Tier 1 MOE2019-T1-001-072, NTU NAP M4082282 and SUG M4082087, Singapore. 2020-12-23T04:40:25Z 2020-12-23T04:40:25Z 2020 Conference Paper 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 2153-697X https://hdl.handle.net/10356/145502 10.1109/ASP-DAC47756.2020.9045103 205 210 en Nanyang Technological University, Singapore (M4082282, M4082087) Ministry of Education, Singapore (MOE2019-T2-1-071, MOE2019-T1-001-072) 10.21979/N9/BPBOYK © 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 application/pdf |
| spellingShingle | Engineering::Computer science and engineering Network Routing Telecommunication Traffic Chen, Peng Liu, Weichen Li, Mengquan Yang, Lei Guan, Nan Contention minimized bypassing in SMART NoC |
| title | Contention minimized bypassing in SMART NoC |
| title_full | Contention minimized bypassing in SMART NoC |
| title_fullStr | Contention minimized bypassing in SMART NoC |
| title_full_unstemmed | Contention minimized bypassing in SMART NoC |
| title_short | Contention minimized bypassing in SMART NoC |
| title_sort | contention minimized bypassing in smart noc |
| topic | Engineering::Computer science and engineering Network Routing Telecommunication Traffic |
| url | https://hdl.handle.net/10356/145502 |
| work_keys_str_mv | AT chenpeng contentionminimizedbypassinginsmartnoc AT liuweichen contentionminimizedbypassinginsmartnoc AT limengquan contentionminimizedbypassinginsmartnoc AT yanglei contentionminimizedbypassinginsmartnoc AT guannan contentionminimizedbypassinginsmartnoc |