IEEE Transactions on Computers · 2003 · 15 citations · 19 references
Cluster ComputingEngineeringComputer ArchitectureFault ToleranceInterconnection Network ArchitectureFault-tolerant DesignCluster TechnologyHardware SecurityHigh-performance ArchitectureK-ary N-cube MultiprocessorParallel ComputingComputer EngineeringNetwork On ChipComputer ScienceFault-tolerant MultiprocessorScalable ComputingFault-tolerant NetworkSpare NodesParallel Programming
We present a strongly fault-tolerant design for the k-ary n-cube multiprocessor and examine its reconfigurability. Our design augments the k-ary n-cube with (k/j)/sup n/ spare nodes. Each set of j/sup n/ regular nodes is connected to a spare node and the spare nodes are interconnected as either a (k/j)-ary n-cube if j/spl ne/(k/2) or a hypercube of dimension n if j=k/2. Our approach utilizes the capabilities of the wave-switching communication modules of the spare nodes to tolerate a large number of faulty nodes. Both theoretical and experimental results are examined. Compared with other proposed schemes, our approach can tolerate significantly more faulty nodes with a low overhead and no performance degradation.
19
M.D. Noakes, Deborah A. Wallach, William J. Dally · 1993 · 235 citations
Algorithm-based fault tolerance on a hypercube multiprocessor
P. Banerjee, J.T. Rahmeh, Craig Stunkel et al. · IEEE Transactions on Computers · 1990 · 131 citations
Fault Tolerance Techniques for Array Structures Used in Supercomputing
Negrini, Sami Sami, Stefanelli · Computer · 1986 · 119 citations