https://www.mdu.se/

mdu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Review, Analysis, and Implementation of Path Selection Strategies for 2D NoCs
Manipal Univ Jaipur, Dept Comp & Commun Engn, Jaipur 303007, India..
Manipal Univ Jaipur, Dept Comp & Commun Engn, Jaipur 303007, India..
Manipal Univ Jaipur, Dept Comp & Commun Engn, Jaipur 303007, India..
Uka Tarsadia Univ, Chhotubhai Gopalbhai Patel Inst Technol CGPIT, Bardoli 394620, Gujarat, India..
Show others and affiliations
2022 (English)In: IEEE Access, E-ISSN 2169-3536, Vol. 10, p. 129245-129268Article in journal (Refereed) Published
Abstract [en]

Recent advances in very-large-scale integration (VLSI) technologies have offered the capability of integrating thousands of processing elements onto a single silicon microchip. Multiprocessor systems-on-chips (MPSoCs) are the latest creation of this technology evolution. As an interconnection network, Network-on-Chip (NoC) has emerged as a scalable and promising solution for MPSoCs to achieve high performance. In NoCs, a routing algorithm is a critical part of a router and provides a path for a packet toward its destination. Every routing algorithm should exhibit two characteristics. First, the route selection function should provide enough degree of adaptiveness to avoid network congestion. Second, it should not offer stale information on network congestion status to the neighboring routers. Many researchers have investigated network congestion and proposed techniques to control/avoid congestion. Such congestion avoidance-based algorithms significantly improve NoC performance. However, they may result in hardware overhead for side network implementation to collect congestion status. This paper reviews various output selection strategies used by routing algorithms to route a packet on a less congested network region. It also classifies them based on techniques adopted to handle and propagate congestion information. Additionally, this article provides the implementation and analysis details of state-of-art selection methods.

Place, publisher, year, edition, pages
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC , 2022. Vol. 10, p. 129245-129268
Keywords [en]
Routing, Adaptive systems, Heuristic algorithms, Classification algorithms, Network-on-chip, Network topology, Dynamic programming, Traffic control, routing algorithm, congestion, selection methods, traffic distribution
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:mdh:diva-61417DOI: 10.1109/ACCESS.2022.3227460ISI: 000899980300001Scopus ID: 2-s2.0-85144743242OAI: oai:DiVA.org:mdh-61417DiVA, id: diva2:1723754
Available from: 2023-01-04 Created: 2023-01-04 Last updated: 2023-01-04Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Daneshtalab, Masoud

Search in DiVA

By author/editor
Daneshtalab, Masoud
By organisation
Embedded Systems
In the same journal
IEEE Access
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 53 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf