On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
A Graph Partitioning Approach to Sequential Diagnosis
IEEE Transactions on Computers
Better Adaptive Diagnosis of Hypercubes
IEEE Transactions on Computers
A fast pessimistic one-step diagnosis algorithm for hypercube multicomputer systems
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
This paper presents a system-level diagnosis algorithm for hypercube multicomputer systems based on the PMC model. The algorithm can isolate all faulty processors to a set with at most one fault-free processor. The breadth-first search (BFS) is applied in the new algorithm. Let N denote the total number of processors in a hypercube system. With the help of properties of hypercube tree defined in this paper and a new tree-decomposition technique, the algorithm runs in O(N) time if log2N ≥ 10; whereas the best-known diagnosis algorithm runs in O(Nlog2N) time if log2N ≥ 19.