An Adaptive Routing Algorithm for on-chip 2D Mesh Network with an Efficient Buffer Allocation Scheme

Atik, Syeda Tanjila; Imran, Muhammad; Mahi, Md. Julkar Nayeen; Jeba, Jenia A; Chowdhury, Zamshed I.; Kaiser, M. Shamim

doi:10.1109/ic4me2.2018.8465582

Cited by 2 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In ZigZag, packets forwarded along the axis have a greater distance, and when the difference along both axes remains only one hop, it starts forwarding in the ZigZag way. Some modifications to XY algorithms are also present by Atik et al [12] and Umapathy et al [112]. In [12] they implement buffer allocation on-demand basis, and [112] proposed to Encircle routing where the network is partitioned into regions, and then packets are forwarded in such a way that they do not enter another region.…”

Section: A Workload Distributionmentioning

confidence: 99%

“…Some modifications to XY algorithms are also present by Atik et al [12] and Umapathy et al [112]. In [12] they implement buffer allocation on-demand basis, and [112] proposed to Encircle routing where the network is partitioned into regions, and then packets are forwarded in such a way that they do not enter another region. Some research work also considers core lifetime.…”

Section: A Workload Distributionmentioning

confidence: 99%

See 1 more Smart Citation

Review, Analysis, and Implementation of Path Selection Strategies for 2D NoCs

et al. 2022

View full text Add to dashboard Cite

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. Network-on-Chip (NoC) is a scalable and promising interconnection solution used by MPSoCs to achieve high performance. Routing algorithms provide a path to a packet toward the destination. For this, these algorithms 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 the selection strategies used to reduce congestion in NoC and classifies them on the technique adopted to handle and propagate congestion information. Additionally, this paper provides the implementation and analysis details of some state-of-art selection methods.

show abstract

Section: A Workload Distributionmentioning

confidence: 99%

Section: A Workload Distributionmentioning

confidence: 99%

Review, Analysis, and Implementation of Path Selection Strategies for 2D NoCs

et al. 2022

View full text Add to dashboard Cite

show abstract

“…The Odd-Even (OE) routing algorithm [18] is proposed to avoid dead-lock caused in XY routing. DyAD [19] is a hybrid routing algorithm which gives both static and adaptive routing conditions. Depending on path congestion, DyAD dynamically switch between routing algorithms.…”

Section: B Related Workmentioning

confidence: 99%