Locating faults in a constant number of parallel testing rounds
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Parallel fault identification algorithm
Journal of Algorithms
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
Diagnosis and Repair in Multiprocessor Systems
IEEE Transactions on Computers
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
A Diagnosis Algorithm for Distributed Computing Systems with Dynamic Failure and Repair
IEEE Transactions on Computers
IEEE Transactions on Computers
Distributed Diagnosis in Dynamic Fault Environments
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We consider a dynamic fault diagnosis problem: there are n processors, to be tested in a series of rounds. In every testing round we use a directed matching to have some processors report on the status (good or faulty) of other processors. Also, in each round up to t processors may break down, and we may direct that up to t processors are repaired. We show that it is possible to limit the number of faulty processors to O(t log2 t), even if the system is run indefinitely. We present an adversary which shows that this bound is optimal.