A Low-Cost Fault-Tolerant Structure for the Hypercube
Document Type
Article
Publication Date
11-1-2001
Abstract
We propose a new, low-cost fault-tolerant structure for the hypercube that employs spare processors and extra links. The target of the proposed structure is to fully tolerate the first faulty node, no matter where it occurs, and "almost fully" tolerate the second, meaning that the underlying hypercube topology can be resumed if the second faulty node occurs at most locations-expectantly 92% of locations. The unique features of our structure are that (1) it utilizes the unused extra link-ports in the processor nodes of the hypercube to obtain the proposed topology, so that minimum extra hardware is needed in constructing the fault-tolerant structure and (2) the structure's node-degrees are low as desired-the primary and spare nodes all have node-degrees of n + 2 for an n-dimensional hypercube. The number of spare nodes is one fourth of primary nodes. The reconfiguration algorithm in the presence of faults is elegant and efficient. The proposed structure also effectively enhances the diagnosability of the hypercube system. It is shown that the diagnosability of the structure is increased to n + 2, whereas an ordinary n-dimensional hypercube has diagnosability n.
DOI
10.1023/A:1011636631661
Montclair State University Digital Commons Citation
Wang, Dajin, "A Low-Cost Fault-Tolerant Structure for the Hypercube" (2001). Department of Computer Science Faculty Scholarship and Creative Works. 37.
https://digitalcommons.montclair.edu/compusci-facpubs/37