Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/145502
Full metadata record
DC FieldValueLanguage
dc.contributor.authorChen, Pengen_US
dc.contributor.authorLiu, Weichenen_US
dc.contributor.authorLi, Mengquanen_US
dc.contributor.authorYang, Leien_US
dc.contributor.authorGuan, Nanen_US
dc.date.accessioned2020-12-23T04:40:25Z-
dc.date.available2020-12-23T04:40:25Z-
dc.date.issued2020-
dc.identifier.citationChen, 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.9045103en_US
dc.identifier.issn2153-697X-
dc.identifier.urihttps://hdl.handle.net/10356/145502-
dc.description.abstractSMART, 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.en_US
dc.description.sponsorshipMinistry of Education (MOE)en_US
dc.language.isoenen_US
dc.relationNanyang Technological University, Singapore (M4082282, M4082087)en_US
dc.relationMinistry of Education, Singapore (MOE2019-T2-1-071, MOE2019-T1-001-072)en_US
dc.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.9045103en_US
dc.subjectEngineering::Computer science and engineeringen_US
dc.titleContention minimized bypassing in SMART NoCen_US
dc.typeConference Paperen
dc.contributor.schoolSchool of Computer Science and Engineeringen_US
dc.contributor.conference2020 25th Asia and South Pacific Design Automation Conference (ASP-DAC)en_US
dc.identifier.doi10.1109/ASP-DAC47756.2020.9045103-
dc.description.versionAccepted versionen_US
dc.identifier.spage205en_US
dc.identifier.epage210en_US
dc.subject.keywordsNetwork Routingen_US
dc.subject.keywordsTelecommunication Trafficen_US
dc.citation.conferencelocationBeijing, Chinaen_US
dc.description.acknowledgementThis 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.en_US
item.grantfulltextopen-
item.fulltextWith Fulltext-
Appears in Collections:SCSE Conference Papers
Files in This Item:
File Description SizeFormat 
Contention minimized bypassing in SMART NoC.pdf184.67 kBAdobe PDFView/Open

Page view(s)

41
Updated on May 10, 2021

Download(s)

4
Updated on May 10, 2021

Google ScholarTM

Check

Altmetric


Plumx

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