Issue No. 10 - October (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.166602
<p>A fault-tolerant communication scheme that facilitates near-optimal routing and broadcasting in hypercube computers subject to node failures is described. The concept of an unsafe node is introduced to identify fault-free nodes that may cause communication difficulties. It is shown that by only using 'feasible' paths that try to avoid unsafe nodes, routing and broadcasting can be substantially simplified. A computationally efficient routing algorithm that uses local information is presented. It can route a message via a path of length no greater than p+2, where p is the minimum distance from the source to the destination, provided that not all nonfaulty nodes in the hypercube are unsafe. Broadcasting can be achieved under the same fault conditions with only one more time unit than the fault-free case. The problems posed by deadlock in faulty hypercubes are discussed, and deadlock-free implementations of the proposed communication schemes are presented.</p>
fault-tolerant communication scheme; hypercube computers; near-optimal routing; broadcasting; node failures; fault-free nodes; computationally efficient routing algorithm; deadlock-free implementations; fault tolerant computing; hypercube networks; parallel architectures.
J. Hayes and T. Lee, "A Fault-Tolerant Communication Scheme for Hypercube Computers," in IEEE Transactions on Computers, vol. 41, no. , pp. 1242-1256, 1992.