Issue No. 09 - September (1993 vol. 42)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.241597
<p>Wormhole routing with the e-cube algorithm is an excellent solution for deadlock-free interprocess communication in healthy hypercubes. However, it does not work for injured hypercubes where some nodes and/or links are faulty. The authors propose a new deadlock-free routing scheme in an injured hypercube with the wormhole routing capability. All previously proposed schemes suggest the use of virtual channels to avoid the cycle of resource dependency. By contrast, the authors' scheme is based on the re-establishment of a routing path to the destination, but it does not always yield a shortest path between the source and destination. The proposed routing scheme uses either wormhole routing or staged routing, depending on the availability of one or more healthy (n-2)-cubes within an injured n-cube.</p>
fault-tolerant routing; injured hypercubes; e-cube algorithm; wormhole routing; deadlock-free; staged routing; average message distance; message latency; successful message delivery; concurrency control; fault tolerant computing; hypercube networks; network routing.
J. Kim, K.G. Shin, "Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes", IEEE Transactions on Computers, vol. 42, no. , pp. 1078-1088, September 1993, doi:10.1109/12.241597