The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers
An Efficient Approach for Fault Diagnosis in a Boolean n-Cube Array of Microprocessors
IEEE Transactions on Computers
A O(t3+ |E| ) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers - Fault-Tolerant Computing
| Hi-index | 0.00 |
In this paper, using a digraph model we present both exact and suboptimum algorithms for finding the maximum level of diagnosis capability offered by a given network of processors. The exact algorithm is based on the Chwa-Hakimi characterization for t-diagnosability and the suboptimum method uses an algorithm for maximum matching in bipartite graphs. Finally, using the notion of syndrome information set, an O(t3) algorithm is presented for t-diagnosis in a large D(N,t,X) system of interconnected processors. Syndrome processing is assumed to be done in a separate fault-free processor.