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
Adaptive System-Level Diagnosis for Hypercube Multiprocessors
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
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
IEEE Transactions on Computers
| Hi-index | 0.00 |
We first consider adaptive serial diagnosis for multiprocessor systems. We present an adaptive diagnosis algorithm using N +t - 1 tests, which is the smallest possible number, for an N-processor system modeled by a (2t -1)-connected graph with at most t faulty processors. We also present an adaptive diagnosis algorithm using minimum number of tests for a system modeled by cube-connected cycles. We consider adaptive parallel diagnosis as well. We show that for adaptive parallel diagnosis of an N-processor system modeled by a hypercube, three testing rounds are necessary and sufficient if the number of faulty processors is at most logN - ⌈log(log N - ⌈log log N⌉+4)⌉+2. We also show that three testing rounds are necessary and sufficient for adaptive parallel diagnosis of a system modeled by cube-connected cycles of dimension greater than three.