.png){kind=icon}
.png){kind=icon}
Return
Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network
.png){kind=icon}
OA
AI
DOI：10.1109/TIE.2010.2081953.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Dynamic routing is desirable because of its substantial improvement in communication bandwidth and intelligent adaptation to faulty links and congested traffic. However, implementation of adaptive routing in a network-on-chip system is not trivial and is further complicated by the requirements of deadlock-free and real-time optimal decision making. In this paper, we present a deadlock-free routing architecture which employs a dynamic programming (DP) network to provide on-the-fly optimal path planning and network monitoring for packet switching. Also, a new routing strategy called k-step look ahead is introduced. This new strategy can substantially reduce the size of routing table and maintain a high quality of adaptation which leads to a scalable dynamic-routing solution with minimal hardware overhead. Our results, based on a cycle-accurate simulator, demonstrate the effectiveness of the DP network, which outperforms both the deterministic and adaptive-routing algorithms in average delay on various traffic scenarios by 22.3%. Moreover, the hardware overhead for DP network is insignificant, based on the results obtained from the hardware implementations.
Keywords:
Adaptive routing
Bellman equation
dynamic programming (DP)
DP network
network-on-chip (NoC)
Journal
IF:
7.2
Papers:
1.8W
Citations:
9.8W
Organization
View more organizations