A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
In this paper, we present adaptive fault-tolerant deadlock-free r outing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n , 1 node faults and can route a message via a path of length no more than the Hamming distance b etween the source and destination plus four. We also develop a routing algorithm for meshes that can toleratedoi:10.1109/ipps.1997.580923 dblp:conf/ipps/Shih97 fatcat:upqtlqjlsza6zaqxghnmsedxom