Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip
Open Access
- 5 January 2023
- journal article
- research article
- Published by MDPI AG in Micromachines
- Vol. 14 (1) , 141
Abstract
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.Keywords
Funding Information
- Basic Research Program at the National Research University Higher School of Economics (HSE University)
This publication has 48 references indexed in Scilit:
- Fully adaptive routing algorithms and region‐based approaches for two‐dimensional and three‐dimensional networks‐on‐chipIET Computers & Digital Techniques, 2013
- A Decision Procedure for Deadlock-Free Routing in Wormhole NetworksIEEE Transactions on Parallel and Distributed Systems, 2013
- A SURVEY ON UNDIRECTED CIRCULANT GRAPHSDiscrete Mathematics, Algorithms and Applications, 2012
- Dense Gaussian Networks: Suitable Topologies for On-Chip MultiprocessorsInternational Journal of Parallel Programming, 2006
- An optimal message routing algorithm for circulant networksJournal of Systems Architecture, 2006
- A survey on multi-loop networksTheoretical Computer Science, 2003
- The odd-even turn model for adaptive routingIEEE Transactions on Parallel and Distributed Systems, 2000
- Ring-network with a constrained number of consecutively-bypassed stationsIEEE Transactions on Reliability, 1998
- Distributed Loop Computer-Networks: A SurveyJournal of Parallel and Distributed Computing, 1995
- A survey of multi-connected loop topologies for local computer networksComputer Networks and ISDN Systems, 1986