A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
On the Complexity of Single Fault Set Diagnosability and Diagnosis Problems
IEEE Transactions on Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
The consensus problem in fault-tolerant computing
ACM Computing Surveys (CSUR)
Probabilistic diagnosis of multiprocessor systems
ACM Computing Surveys (CSUR)
On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems
IEEE Transactions on Computers
Adaptive System-Level Diagnosis for Hypercube Multiprocessors
IEEE Transactions on Computers
Adaptive Unanimous Voting (UV) Scheme for Distributed Self-Diagnosis
IEEE Transactions on Computers
Evaluation of a Diagnosis Algorithm for Regular Structures
IEEE Transactions on Computers
Fault-diagnosis of grid structures
Theoretical Computer Science - Dependable computing
Diagnostic Model and Diagnosis Algorithm of a SIMD Computer
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Exploitation of parallelism in group probing for testing massively parallel processing systems
ATS '95 Proceedings of the 4th Asian Test Symposium
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Distributed fault detection of wireless sensor networks
DIWANS '06 Proceedings of the 2006 workshop on Dependability issues in wireless ad hoc networks and sensor networks
International Journal of Parallel, Emergent and Distributed Systems
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Hi-index | 15.00 |
A distributed diagnosis algorithm to locate faulty processing elements in large-scale regular interconnected structures based on the concepts of system-level diagnosis is developed. This algorithm can either operate in a systolic manner or may be executed on a supervisory processor to locate the faulty processors. The computational complexity of the algorithm is linear when run on a supervisory processor and constant when run in parallel systolic manner. The implementation complexity and diagnosis capability of the algorithm are also analyzed without restricting the fault set size. The probability of correct diagnosis is shown to be very high even in the presence of large fault sets.