MCAR: Non-local adaptive Network-on-Chip routing with message propagation of congestion information

Xie, Ruilian; Xin, Xin; Yang, Bo

doi:10.1016/j.micpro.2016.11.013

Cited by 8 publications

(4 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The congestion measure is a parameter that determines the status of the node whether it is congested or not. The quantity of full or empty buffer [22], number of VCs full or empty [23], and count of arbiter requests [24] are used to calculate this value. A link to the next node is set to be congested if credit remains for buffer are less than a certain threshold.…”

Section: Literature Reviewmentioning

confidence: 99%

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

Ahmed

Baig

2023

Mehran Univ. res. j. eng. technol.

View full text Add to dashboard Cite

Due to advancements in multi-core design technology, IC (Integrated Circuits) designers have expanded the single chip multi-core design. A privileged way of communication effectively between these multi-cores is a Network on-chip (NoC). Design of an effective routing algorithm capable of routing data to non-congested paths is the most notable research challenge in NoC, by retrieving congestion information of non-local nodes. This research proposed an improved congestion-aware load balancing routing algorithm. Non-local or distant links congestion awareness is done by propagating congestion information via data packets. By counting number of hops from the source node, in the quadrant of the destination node, an intermediate node has been defined, and after the calculation of the least congested route to the intermediate node, this route is also stored in the data packet for source routing. Furthermore, for load balancing network is partitioned into two areas called high congested area (HCA) and low congested area (LCA). For load balancing, from HCA a node in LCA is selected as output for data packets. Comparison of the proposed algorithm is done in the form of average latency, average throughput, power consumption, and scalability analysis under synthetic traffic patterns. Under simulation experiments, it is shown improvement in an average latency and throughput of the proposed algorithm is 31.28% and 5.28% respectively, than existing.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

An improved non-local awareness of congestion and load balanced algorithm for the communication of on chip 2D mesh-based network

Ahmed

Baig

2023

Mehran Univ. res. j. eng. technol.

View full text Add to dashboard Cite

show abstract

“…In MCAR, without a data packet, two types of messages propagate between routers for congestion avoidance [23]. One is normal (0), and the other is congested (1).…”

Section: Literature Reviewmentioning

confidence: 99%

Congestion‐Aware Routing Algorithm for NoC Using Data Packets

Ahmad

Sethi

Ullah

et al. 2021

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Network on Chip (NoC) is a communication framework for the Multiprocessor System on Chip (MPSoC). It is a router-based communication system. In NoC architecture, nodes of MPSoC are communicating through the network. Different routing algorithms have been developed by researchers, e.g., XY, intermittent XY, DyAD, and DyXY. The main problems in these algorithms are congestion and faults. Congestion and faults cause delay, which degrades the performance of NoC. A congestion-aware algorithm is used for the distribution of traffic over NoC and for the avoidance of congestion. In this paper, a congestion-aware routing algorithm is proposed. The algorithm works by sending congestion information in the data packet. The algorithm is implemented on a 4 × 4 mesh NoC using FPGA. The proposed algorithm decreases latency, increases throughput, and uses less bandwidth in sharing congestion information between routers in comparison to the existing congestion-aware routing algorithms.

show abstract

“…The routing algorithms GOAL, GAL, DyXY, BARP, ADBR, MaS, Fault-tolerant, FAFT, FT-DyXY, Free-rider, Novel Adaptive, Traffic allocator, MCAR, Efficient deadlock-free, ESPDA and Adaptive multipath are adaptive routing algorithm [9,[14][15][16][17][18][19][20][21][22][23][24][25][26][27][28]. OE and 3DEP are partial adaptive routing algorithm [29,30].…”

Section: Routing Typementioning

confidence: 99%

“…On the other hand, the congestion aware algorithm routes the traffic through the largest available virtual channel. Table 1 show that GAL, DyAD, DyXY, BARP, EDXY, FA-DyAD, CATRA, Free-Rider, Novel adaptive routing, DTRL, MCAR, Adaptive multipath, Link sharing and CFPA are congestion aware algorithms [15,16,20,22,27,28,31,32,44,46,50,52,53]. Congestion awareness decrees latency and increases throughput.…”

Section: Congestion Awarenessmentioning

confidence: 99%