Journal ArticleDOI
An 0(n 2.5 ) Fault Identification Algorithm for Diagnosable Systems
TLDR
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.Abstract:
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.read more
Citations
More filters
Journal ArticleDOI
The consensus problem in fault-tolerant computing
TL;DR: Research on the consensus problem is surveyed, approaches are compared, applications are outlined, and directions for future work are suggested.
Journal ArticleDOI
On self-diagnosable multiprocessor systems: diagnosis by the comparison approach
Aparajita Sengupta,A.T. Dahbura +1 more
TL;DR: In this article, the diagnosability and diagnosis problems for a self-diagnosable multiprocessor system where processors compare the results of tasks performed by other processors in the system are analyzed.
Journal ArticleDOI
Conditional diagnosability measures for large multiprocessor systems
TL;DR: A new measure of diagnosable, called conditional diagnosability, is introduced, by restricting that any faulty set cannot contain all the neighbors of any vertex in the graph, which shows the conditional Diagnosability of the n-dimensional hypercube to be 4(n - 2) +1, which is about four times as large as the classical diagnosis.
Journal ArticleDOI
The g-good-neighbor conditional diagnosability of hypercube under PMC model
TL;DR: The g -good-neighbor conditional diagnosability of Q n is several times larger than the classical diagnosable, and is proved to be 4( n − 2) + 1 under the PMC model.
Journal ArticleDOI
A Generalized Theory for System Level Diagnosis
TL;DR: A completely new generalization of the characterization problem in the system-level diagnosis area is developed and provides necessary and sufficient conditions for any fault-pattern of any size to be uniquely diagnosable, under the symmetric, and asymmetric invalidation models with or without the intermittent faults.
References
More filters
Book
The Design and Analysis of Computer Algorithms
Alfred V. Aho,John E. Hopcroft +1 more
TL;DR: This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
Book
Graph theory with applications
TL;DR: In this paper, the authors present Graph Theory with Applications: Graph theory with applications, a collection of applications of graph theory in the field of Operational Research and Management. Journal of the Operational research Society: Vol. 28, Volume 28, issue 1, pp. 237-238.
Journal ArticleDOI
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
John E. Hopcroft,Richard M. Karp +1 more
TL;DR: This paper shows how to construct a maximum matching in a bipartite graph with n vertices and m edges in a number of computation steps proportional to $(m + n)\sqrt n $.
Journal ArticleDOI
On the Connection Assignment Problem of Diagnosable Systems
TL;DR: This paper treats the problem of automatic fault diagnosis for systems with multiple faults by means of a given arrangement of testing links (connection assignment), and a proper diagnosis can be arrived at for any diagnosable fault pattern.
Proceedings ArticleDOI
An O(v|v| c |E|) algoithm for finding maximum matching in general graphs
Silvio Micali,Vijay V. Vazirani +1 more
TL;DR: An 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs works in 'phases'.