Correct and Almost Complete Diagnosis of Processor Grids
IEEE Transactions on Computers
Evaluation of a Diagnosis Algorithm for Regular Structures
IEEE Transactions on Computers
Diagnostic Model and Diagnosis Algorithm of a SIMD Computer
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Distributed Diagnosis in Dynamic Fault Environments
IEEE Transactions on Parallel and Distributed Systems
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Journal of Electronic Testing: Theory and Applications
An efficient fault detection and diagnosis protocolfor vehicular networks
Proceedings of the third ACM international symposium on Design and analysis of intelligent vehicular networks and applications
| Hi-index | 0.01 |
This paper introduces a diagnosing algorithm for bidimensional processor arrays, where processors are interconnected in horizontal and vertical meshes. For the purpose of diagnosis, the array is considered to be partitioned in square clusters of processors. The algorithm is based on interprocessor tests, using a comparison model. The algorithm, which is divided in four steps, called intracluster diagnosis, interluster diagnosis, fault-free core identification and augmentation, identifies a set of non-faulty and a set of faulty units. The diagnosis is proved to be correct in the worst case, assuming that the actual number of faulty processors is no more that T(N), an increasing function of the number N of processors. It is shown that T(N) is O(N/sup 2/3/). Although correct, the diagnosis is generally incomplete. However, using probabilistic techniques, it is shown that the diagnosis is very likely to be complete under the same limitations which ensure correctness in the worst case.