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
On Adaptive Fault Diagnosis for Multiprocessor Systems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Fast adaptive diagnosis with a minimum number of tests
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Adaptive system-level diagnosis for hypercube multiprocessors using a comparison model
Information Sciences: an International Journal
Disjoint cycles in hypercubes with prescribed vertices in each cycle
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, we consider the problem of adaptive fault-diagnosis in binary n-cubes, and propose a scheme that completes a diagnosis in at most three test rounds, provided that n ≥ 3 and the number of faulty vertices is at most n The proposed scheme is optimal in the sense that: 1) three rounds are necessary for the adaptive diagnosis, 2) there exists a set of n + 1 faulty vertices that can not be located by any diagnosis scheme, and 3) to identify n faulty vertices, the system must contain at least 2n + 1 vertices Note that n = 3 is the smallest integer satisfying 2n ≥ 2n + 1.