Fault-tolerant wormhole routing algorithm in 2d meshes without virtual channels

In wormhole meshes, many routing algorithms prevent deadlocks by enclosing faulty nodes within faulty blocks. None of them however can tolerate the convex fault model without virtual channels. We propose a deterministic fault-tolerant wormhole routing algorithm for mesh networks that can handle disjoint convex faulty regions. These regions would not contain any nonfaulty nodes. The proposed algorithm does not use any virtual channels, which routes the messages using an extended X-Y routing algorithm in the fault-free regions. The algorithm is deadlock- and livelock-free. © Springer-Verlag Berlin Heidelberg 2004.link_to_subscribed_fulltex