2010/10/01 by Terrence Mak, Peter Y. K. Cheung, Kai-Pui Lam +1 · 1 citation
Computer Science · Engineering · Materials Science · #Advanced Memory and Neural Computing #Interconnection Networks and Systems #Supercapacitor Materials and Fabrication
paper · doi:10.1109/tie.2010.2081953
openalex publication_date 2010/10/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/29
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 calledk-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.