Adaptive Routing in Network-on-Chips Using a Dynamic-Programming Network

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, the authors 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.

Provided by: Institute of Electrical & Electronic Engineers Topic: Mobility Date Added: Aug 2011 Format: PDF

Find By Topic