Abstract
In this paper, we consider fault-tolerant routing algorithms in hypercube multicomputer networks. In particular, one of the most quoted adaptive fault-tolerant routing algorithm for hypercubes in the literature is studied in detail and its limited ability to route messages in the presence of some fault patterns (i.e., combination of node and link faults), is pointed out. A modified algorithm is proposed and its performance, using simulation, is compared to that of the above mentioned algorithm. It is shown that the proposed algorithm outperforms the existing one in terms of its ability to route routable messages around the hypercube in the presence of node and/or links faults. This improvement is achieved while using the same average path length or even improving it. Illustrative examples are shown in support of such improvement.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Sultan Alam and R. Melhem, An efficient modular spare allocation scheme and its application to fault-tolerant binary hypercube, IEEE Transactions on Parallel and Distributed Systems 2(1) (1991) 117–126.
P. Banerjee, Strategies for reconfiguring hypercubes under faults, in: IEEE 20th Fault Tolerant Computing Symposium (June 1990) pp. 210–217.
P. Banerjee and M. Peercy, Design and evaluation of hardware strategies for reconfiguring hypercubes and meshes under faults, IEEE Trans. on Computers 43(7) (1994) 841–848.
G. Chen and F. Lau, Shuffle-ring: Overcoming the increasing degree of hypercube, IEEE Trans. on Computers 39(12) (1996) 130–138.
M.S. Chen and K.G. Shin, Adaptive fault-tolerant routing in hypercube multicomputers, IEEE Trans. on Computers 39(12) (1990) 1406–1416.
R. Cypher, Minimal, deadlock-free routing in hypercubic and arbitrary networks, in: 7th IEEE Symp. on Parallel and Distributed Processing (October 1995) pp. 122–129.
P.T. Gaughan and S. Yalamanchili, Adaptive routing protocols for hypercube interconnection networks, IEEE Computer (May 1993) 12–23.
C.-T. Ho and M.-Y. Kao, Optimal broadcast in all-port wormholerouted hypercubes, IEEE Trans. on Parallel and Distributed Systems 6(2) (1995) 200–203.
J. Kim and K.G. Shin, Deadlock-free fault-tolerant routing in injured hypercubes, IEEE Trans. on Computers 42(9) (1993) 1078–1088.
D.H. Linder and J.C. Harden, An adaptive fault tolerant wormhole routing strategy for k-ary n-cubes, IEEE Trans. on Computers 40(1) (1991) 2–12.
D. Pifarre and J. Sanz, Fully adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks: Algorithms and simulations, IEEE Transactions on Parallel and Distributed Systems (March 1994) 247–263.
D.A. Rennels, On implementing fault-tolerance in binary hypercubes, in: IEEE 16th Int. Symp. on Fault Tolerant Computing (June 1986) pp. 344–349.
Y. Saad and M.H. Schultz, Topological properties of hypercubes, IEEE Trans. on Computers C-37(7) (1988) 867–872.
W. Shi and P. Srimani, Hyper-butterfly network: A scalabe optimally fault tolerant architecture, in: Parallel Processing Symposium (December 1998) pp. 732–736.
M.-S. Chenand K.G. Shin, Depth-first search approach for faulttolerant routing in hypercube multicomputers, IEEE Trans. on Parallel and Distributed Systems 1(2) (1990) 152–159.
S.-C. Wang and S.-Y. Kuo, A fault-tolerant deadlock-free multicast algorithm for wormwhole routed hypercubes, IEICE Transactions on Information and Systems E82(3) (1999) 677–686.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Abd-El-Barr, M.I., Nadeem, M.M. & Al-Tawil, K. A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks. Cluster Computing 4, 253–262 (2001). https://doi.org/10.1023/A:1011454709330
Issue Date:
DOI: https://doi.org/10.1023/A:1011454709330