Optimal Diagnosis of Heterogeneous Systems with Random Faults
IEEE Transactions on Computers
Better Adaptive Diagnosis of Hypercubes
IEEE Transactions on Computers
Optimal Adaptive Fault Diagnosis of Hypercubes
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
On Adaptive Fault Diagnosis for Multiprocessor Systems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Reliable Fault Diagnosis with Few Tests
Combinatorics, Probability and Computing
The rainbow skip graph: a fault-tolerant constant-degree distributed data structure
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Efficient parallel algorithms for dead sensor diagnosis and multiple access channels
Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Pipelined algorithms to detect cheating in long-term grid computations
Theoretical Computer Science
Fast adaptive diagnosis with a minimum number of tests
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Diagnosis in the presence of intermittent faults
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Three-round adaptive diagnosis in binary n-cubes
ISAAC'04 Proceedings of the 15th 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
Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
Information Sciences: an International Journal
| Hi-index | 0.01 |
Consider a set of n processors that can communicate with each other. Assume that each processor can be either "good" or "faulty". Also assume that the processors can test each other. We consider how to use parallel testing rounds to identify the faulty processors, given an upper bound t on their number. We prove that 4 rounds are necessary and sufficient when 2/spl radic/(2n)/spl les/0.03n (for n sufficiently large). Furthermore, at least 5 rounds are necessary when t/spl ges/0.49n (for n sufficiently large), and 10 rounds are sufficient when t0.5n (for all n). (It is well known that no general solution is possible when t/spl ges/0.5n).