Coding and information theory (2nd ed.)
Coding and information theory (2nd ed.)
Multigrid Algorithms on the Hypercube Multiprocessor
IEEE Transactions on Computers
An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Binary Tree Architecture
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
A Low-Cost Fault-Tolerant Structure for the Hypercube
The Journal of Supercomputing
| Hi-index | 0.00 |
We propose a new fault-tolerant design of a hypercube system. We first build thefault-tolerant modules (FTM's), then we interconnect these FTM's as the modularhypercube. Finally, we obtain our proposed system by augmenting links, called thespare-sharing links (SSL's), in the modular hypercube, which forms a ring connection inour architecture. The characteristic of our system is that the spare nodes in an FTM canbe used as local spares to replace the faulty nodes in the FTM, or as remote spares toreplace the faulty nodes in other FTM's via the spare-sharing links in the architecture.Thus, the use of spare nodes in any FTM will increase, and the proposed system reliability will improve. In the system, the switch and link failures are also considered. The modular diagnosis and modular reconfiguration are proposed to identify and reconfigure the failure of nodes, switches, and links.