Publication Type:

Journal Article


Microelectronics Journal, Elsevier Ltd, Volume 45, Number 8, p.989-1000 (2014)



Algorithms, Data packet transmission, Deadlock-free routing algorithms, Deadlocks, Distributed computer systems, Distributed routing algorithm, Fault tolerant computer systems, Hamiltonian connected, Hamiltonians, Microprocessor chips, Network-on-chip, Network-on-chip(NoC), routing, Routing algorithms, Routing protocols, System on chip design, Topology


Network on Chip (NoC) has been proposed as a solution for addressing the challenges in System on Chip (SoC) design. Designing a topology and its routing schemes are vital problems in a NoC. One of the major challenges that designers face today in 3D integration is how to route the data packets within a layer and across the layers in a scalable and efficient manner. In any 3D topology, minimizing the amount of data packet transmissions during the routing is still an open problem. Any efficient traditional routing schemes should avoid deadlocks and minimize network congestion from a source node to a destination node. In this paper, we propose a 3D recursive hyper graph Hamiltonian connected network and we propose a deadlock free routing algorithm to minimize congestion in the network. We show that the proposed topology outperforms the topology presented by Dubois et al. (Elevator-First: a Dealock-free distributed routing algorithm for vertically partially connected 3d-Nocs, IEEE Trans. Comput. 62(3) (2013) 609-615) [1] with respect to average network latency. Also, we analysis the delay bound of the switches for the proposed topology and 3D Partially connected Mesh Topology (PMT) and conclude that our topology performs better than 3D PMT. © 2014 Elsevier Ltd.


cited By (since 1996)0

Cite this Research Publication

Dr. Somasundaram K., Plosila, Jb, and Viswanathan, Nc, “Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs”, Microelectronics Journal, vol. 45, pp. 989-1000, 2014.