A Heuristic-Based Wormhole Routing Algorithm for Hypercube Multicomputer Networks

Authors:
Mostafa I. Abd-El-Barr;Mohammad M. Nadeem;Khalid Al-Tawil
Affiliations:
Departments of Computer Engineering and Information & Computer Science, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia;Departments of Computer Engineering and Information & Computer Science, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia;Departments of Computer Engineering and Information & Computer Science, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia
Venue:
Cluster Computing
Year:
2001

Citing 13
Cited 0

Topological Properties of Hypercubes

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes

IEEE Transactions on Computers
Optimal Broadcast in All-Port Wormhole-Routed Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Adaptive routing protocols for hypercube interconnection networks

Computer
Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes

IEEE Transactions on Computers
Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults

IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Parallel and Distributed Systems
An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations

IEEE Transactions on Parallel and Distributed Systems
The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube

HPCA '96 Proceedings of the 2nd IEEE Symposium on High-Performance Computer Architecture
Minimal, deadlock-free routing in hypercubic and arbitrary networks

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Hyper-Butterfly Network: A Scalable Optimally Fault Tolerant Architecture

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium

Quantified Score

Hi-index	0.00

Visualization

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.