Algorithm-based fault tolerance on a hypercube multiprocessor
P. Banerjee, Joseph T. Rahmeh, Craig B. Stunkel et al. · IEEE Transactions on Computers · 1990
The design of fault-tolerant hypercube multiprocessor architecture is discussed. The authors propose the detection and location of faulty processors concurrently with the actual execution of parallel applications on the hypercube using a novel scheme of algorithm-based error detection. System-level error detection mechanisms have been implemented for three parallel applications on a 16-processor Intel iPSC hypercube multiprocessor: matrix multiplication, Gaussian elimination, and fast Fourier transform. Schemes for other applications are under development. Extensive studies have been done of error coverage of the system-level error detection schemes in the presence of finite-precision arithmetic, which affects the system-level encodings. Two reconfiguration schemes are proposed that allow the authors to isolate and replace faulty processors with spare processors.>
Cited by 129 works. doi:10.1109/12.57055
Authors
References
- The cosmic cube
- Solving Problems on Concurrent Processors
- Algorithm-Based Fault Tolerance for Matrix Operations
- Concurrent error detection using watchdog processors-a survey
- DEPENDABLE COMPUTING AND FAULT TOLERANCE : CONCEPTS AND TERMINOLOGY
- Matrix factorization on a hypercube multiprocessor
- Fault Diagnosis in a Boolean n Cube Array of Microprocessors
- Processor Control Flow Monitoring Using Signatured Instruction Streams
- Roundoff noise in floating point fast Fourier transform computation
- A reconfigurable and fault-tolerant VLSI multiprocessor array