The Comparison Approach to Multiprocessor Fault Diagnosis
IEEE Transactions on Computers
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Incomplete Fault Coverage In Modular Miltiprocessor Systems
ACM '78 Proceedings of the 1978 annual conference
Fault detection and diagnosis in multiprocessor systems
Fault detection and diagnosis in multiprocessor systems
Complexity of Fault Diagnosis in Comparison Models
IEEE Transactions on Computers
Optimal Fault Diagnosis in Comparison Models
IEEE Transactions on Computers
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Globally Optimal Diagnosis in Systems with Random Faults
IEEE Transactions on Computers
Optimal Diagnosis of Heterogeneous Systems with Random Faults
IEEE Transactions on Computers
Diagnosis and Repair in Multiprocessor Systems
IEEE Transactions on Computers
Efficient Comparison-Based Fault Diagnosis of Multiprocessor Systems Using Genetic Algorithms
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Reliable Fault Diagnosis with Few Tests
Combinatorics, Probability and Computing
Distributed Diagnosis in Dynamic Fault Environments
IEEE Transactions on Parallel and Distributed Systems
A flexible formal framework for masking/demasking faults
Information Sciences—Informatics and Computer Science: An International Journal
International Journal of Parallel, Emergent and Distributed Systems
| Hi-index | 15.00 |
The author considers two comparison-based diagnosis models previously introduced by K.Y. Chwa et al. (1981) and M. Malek (1980). For each of them, classical t-diagnosability and probabilistic diagnosability based on the maximum likelihood principle are discussed, probabilistic model for comparison testing is introduced. In all considered models, optimal diagnosable systems, i.e., those which use the least possible number of testing links, are designed. These systems have a linear number of links and can be diagnosed in linear time. It is proved, however, that for general systems, both diagnosis and diagnosability problems are NP-hard. The model is used for fault diagnosis of multiprocessor systems.