在此次論文中, 我們想對方格網狀平行處理結構(mesh), 提出一套不具
虛擬通道(virtual channels), 同時, 又可達到容錯(fault-tolerant)功
能之繞線演算法(routing algorithm)。我們的方法借用了, 在具虛擬通
道容錯繞線方法中, 所使用的損壞環(fault rings)及損壞鏈(fault
chains)的觀念, 來加以運用。最重要的,此演算法在容忍損壞點的數目上
是可以任意的, 同時也無須犧牲掉太多的非損壞節點。而在演算法中, 我
們利用在損壞環及損壞鏈上節點的少許訊息來作為在繞線路徑的參考, 使
不具虛擬通道的繞線, 同樣可以達到避免死結(deadlock-free)的目的。
在最後我們也模擬此演算法來證明我們提出的理論。

We present a fault-tolerant routing algorithm which requires no
virtualchannels for mesh networks. Our method employs the
concepts of faultrings and fault chains, which were previously
used with virtual channels,to facilitate fault-tolerant routing.
The proposed algorithm toleratesany number of faults without
disabling a large number of nonfaulty nodes.Moreover, only the
nodes on fault rings and fault chains need to maintaina small
routing information. By enforcing a set of rules on
travelingdirection on fault rings and fault chains, the
algorithm is guaranteedto be deadlock-free. Simulation results
demonstrate the usefulness ofthe routing algorithm.