Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Parallel algorithms for gossiping by mail
Information Processing Letters
Introduction to algorithms
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
On the routing problem in faulty supercubes
Information Processing Letters
Data Transfers in Broadcast Networks
IEEE Transactions on Computers
Tolerating Faults in Hypercubes Using Subcube Partitioning
IEEE Transactions on Computers - Special issue on fault-tolerant computing
An efficient algorithm for multiple simultaneous broadcasts in the hypercube
Information Processing Letters
Dense edge-disjoint embedding of complete binary trees in the hypercube
Information Processing Letters
Embedding all binary trees in the hypercube
Journal of Parallel and Distributed Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
IEEE Transactions on Computers
Fault-Tolerant Embedding of Complete Binary Trees in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Embedding and Reconfiguration of Binary Trees in Faulty Hypercubes
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Reconfiguration of Faulty Hypercubes
EDCC-1 Proceedings of the First European Dependable Computing Conference on Dependable Computing
Software Implemented Fault Tolerance in Hypercube
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
IEEE Transactions on Computers
Proof that pyramid networks are 1-Hamiltonian-connected with high probability
Information Sciences: an International Journal
| Hi-index | 0.00 |
The problem of tolerating faulty nodes in hypercubes has been studied by many researchers either by using spares or by reconfiguration. In this paper, algorithms for tolerating faulty nodes and links in hypercubes are presented. The algorithms are based on using general spanning trees (GST), complete unbalanced spanning trees (CUST), and balanced spanning trees (BST) for reconfiguring the hypercube to avoid faulty nodes and links. The algorithms contain two phases: The first phase involves the construction of the spanning tree and the second one is for reconfiguring the hypercube should a faulty node be detected. The reconfiguration process consists of two basic steps. First, the faulty node is disconnected from the spanning tree. Then, a new spanning tree is constructed by reconnecting the children of the faulty node to the spanning tree. One hundred percent single fault correction (avoidance) and almost 100 percent fault correction (avoidance) of double and triple faults are achieved by the proposed algorithms for hypercubes having a dimension of n驴 6. Simulation results for the algorithm under more than three faults also are presented. For any k faulty nodes (1 驴k驴 2n驴 1), the reconfiguration algorithm may be applied k times to avoid these k faulty nodes as long as no combination of any two of the faults results in a blocking situation. The proposed reconfiguration algorithms tolerate all possible single-link faults. The reconfiguration algorithms are extended to tolerate (k驴n驴 1) multiple faults, causing blocking situation, with a backtracking.