Tree-Based Routing for Faulty On-Chip Networks with Mesh Topology

Network-on-chip (NoC) architectures have been recently proposed as the communication framework for large-scale chips. The design of the routing system for the packet-switched on-chip network is one of the critical issues for the success of NoC architectures, especially when there are faulty components in the network. In this paper, we present a routing technique that uses an embedded tree for mesh networks to achieve high-performance on-chip communication. In this design, the abundant links not belonging to the embedded tree become shortcuts to reduce the distance for packet routing. We show that our routing is deadlock-free and, with appropriate mapping of the tree, equivalent to the well-known XY routing for mesh networks. Furthermore, when there are faulty components in the network, our switch can still successfully deliver packets through tree re-mapping as long as the network is connected. Our design is evaluated by using static analysis and simulation for faulty networks with various network sizes. The results show that our design achieves superior performance without using a routing table in the switch for faulty mesh on-chip networks.

[1]  S.-D. Wang,et al.  Fault-tolerant wormhole routing algorithm for mesh networks , 2000 .

[2]  Luca Benini,et al.  Network-on-chip architectures and design methods , 2005 .

[3]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[4]  Jiazheng Zhou,et al.  A Tree-Turn Model for Irregular Networks , 2006, Fifth IEEE International Symposium on Network Computing and Applications (NCA'06).

[5]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[6]  Maurizio Palesi,et al.  Deadlock Free Routing Algorithms for Mesh Topology NoC Systems with Regions , 2006, 9th EUROMICRO Conference on Digital System Design (DSD'06).

[7]  Hideharu Amano,et al.  L-turn routing: an adaptive routing in irregular networks , 2001, International Conference on Parallel Processing, 2001..

[8]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[9]  Hsin-Chou Chi,et al.  A deadlock-free routing scheme for interconnection networks with irregular topologies , 1997, Proceedings 1997 International Conference on Parallel and Distributed Systems.

[10]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[11]  W. Dally,et al.  Route packets, not wires: on-chip interconnection networks , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[12]  Suresh Chalasani,et al.  Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks , 1995, IEEE Trans. Computers.