论文信息 - Fault-tolerant wormhole routing in 2D meshes

Fault-tolerant wormhole routing in 2D meshes

A deterministic fault-tolerant wormhole routing algorithm is presented for mesh networks in this paper. The proposed algorithm can tolerate convex fault-connected regions with only three virtual channels per physical channel, and overlapping of processors along the boundaries of different fault regions is allowed. The proposed algorithm, which routes the messages by XY routing algorithm in the fault-free regions, is deadlock- and livelock-free.

Jipeng Zhou | Francis C. M. Lau

[1] Taisook Han,et al. Fault-Tolerant Wormhole Routing in Mesh with Overlapped Solid Fault Regions , 1997, Parallel Comput..

[2] Suresh Chalasani,et al. Fault-Tolerant Communication with Partitioned Dimension-Order Routers , 1999, IEEE Trans. Parallel Distributed Syst..

[3] Suresh Chalasani,et al. Communication in Multicomputers with Nonconvex Faults , 1995, IEEE Trans. Computers.

[4] William J. Dally,et al. Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[5] Sheng-De Wang,et al. An Improved Algorithm for Fault-Tolerant Routing in Hypercubes , 1997, IEEE Trans. Computers.

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

[7] Lionel M. Ni,et al. Fault-tolerant wormhole routing in meshes without virtual channels , 1996, IEEE Transactions on Parallel and Distributed Systems.