ZigZag: An efficient deterministic Network-on-chip routing algorithm design

Valencia, Pedro; Müller, E.; Wang, Nan

doi:10.1109/iemcon.2017.8117126

Cited by 6 publications

(8 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It uses the source-destination node's location to measure load factor distribution for the network. Basic deterministic routing algorithm XY forward packet first along x-axis & then along the y-axis, and YX does it in the opposite scenario, based on this algorithm Valencia et al [113] proposed ZigZag routing algorithm. 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.…”

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

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%

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

et al. 2022

View full text Add to dashboard Cite

show abstract

“…An adaptive routing called zigzag routing was introduced in [58]. In it packets move in alternate x and y directions.…”

Section: Performancementioning

confidence: 99%

A Review of Design Approaches for Enhancing the Performance of NoCs at Communication Centric Level

Manzoor

Mir

Hakim

2021

SCPE

View full text Add to dashboard Cite

As the trend of technology shrinking continues a vast amount of processors are being incorporated in a limited space. Due to this almost half of the chip area in Multi-Processor Systems-on-Chips (MPSoCs) is under interconnections, which pose a big problem for communication. Network-on-Chips (NoCs) evolved as a significant scalable solution for removing wiring congestion and communication problem in MPSoCs. NoCs provide the advantage of customized architecture, increased scalability and bandwidth. NoC is a structured framework where communication is the prime concern. In this review paper we present an overview of research and design approaches in the communication centric areas of NoCs. Here we have tried to discuss and iterate most of the available work done for communication in 2D NoCs. This paper gives the insight of different attributes and performance parameters of NoCs. Further it gives a detailed description of how topology, flow control and routing mechanisms can affect the qualitative aspects (performance) of NoCs. It then explains how various attributes of routing can help in increasing the efficacy of NoCs. Subsequently a brief review of different simulators used for NoCs is given. All of this is provided based on the survey of academic, theoretical and experimental approaches presented in the past. Finally some suggestions for future work are also given.

show abstract

“…DyAD and FA-DyAD are adaptive and deterministic [31,32]. The deterministic routing algorithms are FTXY and ZigZig [33,34]. Some more classification is possible like congestion aware algorithm, and Fault-Tolerance-routing algorithm will discuss in section 6 and 7.…”

Section: Routing Typementioning

confidence: 99%

“…The power consumption of FT-XY under uniform traffic of 4×4 NoC is .01 to .09 J and for 6×6 NoC its .02 to .09 J for injection rate of .005 to .019 packet/cycle/node [33]. The power consumption for ADBR is .00035J, for MaS algorithm it's a 6.5w at injection rate of 0.21 packet/cycle/node, for Traffic allocation routing algorithm it's 61.973mw when load is 50%, for ZigZig algorithm it's 62.698mw when load is 50% and for Link sharing algorithm it's 2.86mw [17,19,24,34,50].…”

Section: Power Dissipationmentioning

confidence: 99%