Deadlock free routing algorithm for minimizing congestion in a Hamiltonian connected recursive 3D-NoCs |
| |
Authors: | K. Somasundaram Juha Plosila N. Viswanathan |
| |
Affiliation: | 1. Department of Mathematics, Amrita Vishwa Vidyapeetham, Coimbatore, India;2. Department of Information Technology, University of Turku, Finland;3. Department of ECE, Mahendra Engineering College, Namakkal, India |
| |
Abstract: | 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. |
| |
Keywords: | Network on Chip 3D-topology Routing Deadlocks |
本文献已被 ScienceDirect 等数据库收录! |