Adaptive, fault-tolerant, deadlock-free and livelock-free interval routing in mesh networks

An adaptive, deadlock-free and livelock-free routing algorithm for faulty two-dimensional mesh connected multiprocessor interconnection networks based on store-and-forward communication is presented in this paper. Only three virtual networks, VN/sub 0/, VN/sub 1/ and VN/sub 2/, are needed. The algorithm is composed of two parts. Part one implemented in VN/sub 0/ is deadlock-free and allows a packet to use the path with minimum traffic congestion. Part two is fully-adaptive minimal routing. It requires two virtual networks-VN/sub 1/ and VN/sub 2/.