A Survey on Network on Chip Routing Algorithms Criteria

Kaleem, Muhammad; Isnin, Ismail Fauzi

doi:10.1007/978-981-15-6048-4_40

Cited by 6 publications

(4 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[5,43,62,121,127] provide a survey on routing algorithms and their classification. Gabis and Koudil [43] classify based on protocol uses, Wu et al [121] classify based on path diversity, Zulkefli et al [127] compare adaptive routing, Ahmad and Sethi [5] review routing algorithms and Kaleem and Isnin [62] classify based on path diversity with criteria such as thermal aware, aging aware, power efficiency, fault aware and resilience. [84] present survey on congestion control mechanism in WiNoC.…”

Section: A Motivationmentioning

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 Motivationmentioning

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

“…Although hierarchical architectures have addressed the majority of the associated challenges of the traditional interconnection techniques, the main limiting factor is scalability, and NoC has proven to be a promising solution. As communicating nodes require a routing algorithm for successful transmission of packets, it is important to design an NoC routing algorithm capable of providing less congested paths, better energy efficiency, and high scalability [5]. It is important to mention that the same choices of routing algorithms, when considered for more than one performance parameter of the network, do not yield expected results, since different applications exhibit different network performances for the same routing technique [6].…”

Section: Introduction To Information Graph Theorymentioning

confidence: 99%

Navigability, Walkability, and Perspicacity Associated with Canonical Ensembles of Walks in Finite Connected Undirected Graphs—Toward Information Graph Theory

Volchenkov

2023

Information

View full text Add to dashboard Cite

Canonical ensembles of walks in a finite connected graph assign the properly normalized probability distributions to all nodes, subgraphs, and nodal subsets of the graph at all time and connectivity scales of the diffusion process. The probabilistic description of graphs allows for introducing the quantitative measures of navigability through the graph, walkability of individual paths, and mutual perspicacity of the different modes of the (diffusion) processes. The application of information theory methods to problems about graphs, in contrast to geometric, combinatoric, algorithmic, and algebraic approaches, can be called information graph theory. As it involves evaluating communication efficiency between individual systems’ units at different time and connectivity scales, information graph theory is in demand for a wide range of applications, such as designing network-on-chip architecture and engineering urban morphology within the concept of the smart city.

show abstract

“…Such algorithms as XY [ 27 , 28 ], Odd-Even [ 29 ], SOE [ 30 ], Duato’s protocol [ 31 ], and others [ 25 ] for mesh topology, by using simple rules, guarantee the existence of many possible paths that do not have overlaps, and this ensures the absence of deadlocks and significantly improves the network performance. The importance of providing deadlock-freedom for the routing algorithms in NoCs is confirmed by the fact that hundreds of variations have already been developed for various topologies and NoCs implementations, which is reflected in a number of surveys [ 9 , 32 , 33 , 34 ]. Meanwhile, the use of circulant topologies in NoCs has still been little studied (although reflected in some works) [ 8 , 17 , 35 ].…”

Section: Introductionmentioning

confidence: 99%

Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip

Romanov

Myachin²,

Lezhnev

et al. 2023

Micromachines

View full text Add to dashboard Cite

This article considers the usage of circulant topologies as a promising deadlock-free topology for networks-on-chip (NoCs). A new high-level model, Newxim, for the exploration of NoCs with any topology is presented. Two methods for solving the problem of cyclic dependencies in circulant topologies, which limit their applications for NoCs due to the increased possibility of deadlocks, are proposed. The first method of dealing with deadlocks is universal and applicable to any topology; it is based on the idea of bypassing blocked sections of the network on an acyclic subnetwork. The second method—Ring-Split—takes into account the features of circulant topologies. The results of high-level modeling and comparison of the peak throughput of NoCs for circulant and mesh topologies using deadlock-free routing algorithms are presented. It was shown that a new approach for routing in circulants (compared to mesh topology) shows up to 59% better network throughput with a uniform distribution of network load.

show abstract

A Survey on Network on Chip Routing Algorithms Criteria

Cited by 6 publications

References 32 publications

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

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

Navigability, Walkability, and Perspicacity Associated with Canonical Ensembles of Walks in Finite Connected Undirected Graphs—Toward Information Graph Theory

Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip

Contact Info

Product

Resources

About