Gracefully Degradable Processor Arrays
IEEE Transactions on Computers
Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems
IEEE Transactions on Computers - The MIT Press scientific computation series
Determining performance measures of algorithm-based fault tolerant systems
Journal of Parallel and Distributed Computing
Reliable Distributed Sorting Through the Application-Oriented Fault Tolerance Paradigm
IEEE Transactions on Parallel and Distributed Systems
A General Method for Maximizing the Error-Detecting Ability of Distributed Algorithms
PARLE '94 Proceedings of the 6th International PARLE Conference on Parallel Architectures and Languages Europe
Reliable parallel processing: the application oriented paradigm
Reliable parallel processing: the application oriented paradigm
| Hi-index | 0.00 |
The bound on component failures and their spatial distribution govern the fault tolerance of any candidate error-detecting algorithm. For distributed memory multiprocessors, the specific algorithm and the topology of the processor interconnection network define these bounds. This paper introduces the maximal fault index, derived from the system topology and local communication patterns, to demonstrate how a maximal number of simultaneous component failures can be tolerated for a particular interconnection network and error-detecting algorithm. The index is used to design a mapping of processes to processor groups such that the error-detecting ability of the algorithm is preserved for certain multiple simultaneous processor failures.