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-flee.
Citation:
J. Zhou, F. Lau, "Fault-Tolerant Wormhole Routing in 2D Meshes," ispan, pp.94, 2000 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN '00), 2000