IEEE Transactions on Computers - The MIT Press scientific computation series
Almost sure fault tolerance in random graphs
SIAM Journal on Computing
Locating faults in a constant number of parallel testing rounds
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A guided tour of Chernoff bounds
Information Processing Letters
Undirected Graph Models for System-Level Fault Diagnosis
IEEE Transactions on Computers
Complexity of Fault Diagnosis in Comparison Models
IEEE Transactions on Computers
Efficient Diagnosis of Multiprocessor Systems Under Probabilistic Models
IEEE Transactions on Computers
Intermittent Fault Diagnosis in Multiprocessor Systems
IEEE Transactions on Computers
Fault diagnosis in a small constant number of parallel testing rounds
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Globally Optimal Diagnosis in Systems with Random Faults
IEEE Transactions on Computers
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Better Adaptive Diagnosis of Hypercubes
IEEE Transactions on Computers
Information Processing Letters
Minimizing the number of inputs while applying adaptive test cases
Information Processing Letters
Minimizing the number of inputs while applying adaptive test cases
Information Processing Letters
Fast adaptive diagnosis with a minimum number of tests
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Combinatorial pair testing: distinguishing workers from slackers
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
We consider the problem of fault diagnosis in multiprocessor systems. Processors perform tests on one another: fault-free testers correctly identify the fault status of tested processors, while faulty testers can give arbitrary test results. Processors fail independently with constant probability pqq-diagnosis is a fault diagnosis algorithm whose probability of error does not exceed q. We show that the minimum number of tests to perform q-diagnosis for n processors is Θ(n log 1/q) in the nonadaptive case and n+Θ( log 1/q) in the adaptive case. We also investigate q-diagnosis algorithms that minimize the maximum number of tests performed by, and performed on, processors in the system, constructing testing schemes in which each processor is involved in very few tests. Our results demonstrate that the flexibility yielded by adaptive testing permits a significant saving in the number of tests for the same reliability of diagnosis.