Fault-Tolerant Routing in Wormhole Meshes

[[abstract]]©2003 World Scientific Publishing-In wormhole meshes, many a routing algorithm prevents a deadlock by enclosing unlimited number of faulty nodes with faulty blocks and dividing a physical interconnection network into a fixed number of virtual ones; none of them, however, is able to tolerate two faulty blocks with a distance of two, no less, in at least one dimension by use of only two virtual interconnection networks. To fill this gap, an adaptive and fault-tolerant routing algorithm is proposed. The algorithm is fully-adaptive until encountering a faulty block. It then detours the blocked message around the faulty block. Arranging the detours around faulty blocks attempts to prevent a deadlock. The proposed method has no need for global information.[[department]]資訊工程學