The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Theory With Applications
Graph Theory With Applications
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
On Fault Identification in Diagnosable Systems
IEEE Transactions on Computers
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers
An Approach to the Diagnosability Analysis of a System
IEEE Transactions on Computers
On the Computational Complexity of System Diagnosis
IEEE Transactions on Computers
An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures
IEEE Transactions on Computers
System Fault Diagnosis: Masking, Exposure, and Diagnosability Without Repair
IEEE Transactions on Computers
An O (N2.5) algorithm for maximum matching in general graphs
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
On the asymptotic complexity of matrix multiplication
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
A fault identification algorithm for ti-diagnosable systems
IEEE Transactions on Computers - The MIT Press scientific computation series
IEEE Transactions on Computers - The MIT Press scientific computation series
Optimal Diagnosable System Design Using Full-Difference Triangles
IEEE Transactions on Computers
The Comparison Approach to Multiprocessor Fault Diagnosis
IEEE Transactions on Computers
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
(t,k)-Diagnosis for Matching Composition Networks
IEEE Transactions on Computers
(t, k) - Diagnosis for Matching Composition Networks under the MM* Model
IEEE Transactions on Computers
A Local Diagnosability Measure for Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
Worst-Case Diagnosis Completeness in Regular Graphs under the PMC Model
IEEE Transactions on Computers
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Diagnosis service for embedded software component based systems
Proceedings of the 2007 workshop on Engineering fault tolerant systems
On conditional diagnosability of the folded hypercubes
Information Sciences: an International Journal
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
Strong diagnosability of regular networks under the comparison model
Information Processing Letters
On conditional diagnosability and reliability of the BC networks
The Journal of Supercomputing
International Journal of Parallel, Emergent and Distributed Systems
Conditional diagnosability of hypercubes under the comparison diagnosis model
Journal of Systems Architecture: the EUROMICRO Journal
One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems
Journal of Systems and Software
Conditional diagnosability of matching composition networks under the PMC model
IEEE Transactions on Circuits and Systems II: Express Briefs
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Probabilistic diagnosis of clustered faults for shared structures
Mathematical and Computer Modelling: An International Journal
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of balanced hypercubes under the PMC model
Information Sciences: an International Journal
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
| Hi-index | 15.00 |
Consider a system composed of n independent processors, each of which tests a subset of the others. It is assumed that at most tp of these processors are permanently faulty and that the outcome of a test is reliable if and only if the processor which performed the test is fault free. Such a system is said to be tp-diagnosable if, given any complete collection of test results, the set of faulty processors can be uniquely identified. In this paper, it is shown that tp-diagnosable systems, due to their robust interconnection structure, possess heretofore unknown graph theoretic properties relative to vertex cover sets and maximum matchings. An 0(n2.5) algorithm is given which exploits these properties to identify the set of faulty processors in a tp-diagnosable system. The algorithm is shown to be correct, complete, not based on any conjecture, and superior to any other known fault identification algorithm for the general class of tp-diagnosable systems.