Complexity of system-level fault diagnosis and diagnosability
Thesis/Dissertation
·
OSTI ID:6987373
It is now possible to design and build systems that incorporate a large number of processing elements. For this reason, fault-diagnosis at the system level, a research area pioneered by the work of Preparata, Metze, and Chien, is of increasing importance. The formalization of their model utilizes directed graphs together with labelings on edges and vertices. The two central problems introduced by the model are called the diagnosis and diagnosability problems. In the diagnosis problem, an algorithm must identify the faulty units of a system based on test results. In the diagnosability problem, an algorithm must determine the maximum number of faulty units a system can contain and still be guaranteed capable of successfully testing itself. One of the main open questions is resolved for this model by presenting the first polynomial time algorithm for the diagnosability problem. The solution uses network-flow techniques and runs in O(absolute value E absolute value V/sup 3/2/) time. Also presented is a new time-complexity bound of O(min(t absolute value E, t/sup 3/ + absolute value E)) for the diagnosis problem, where t is the maximum number of faulty units.
- Research Organization:
- Yale Univ., New Haven, CT (USA)
- OSTI ID:
- 6987373
- Country of Publication:
- United States
- Language:
- English
Similar Records
Diagnosability issues in multiprocessor systems
A fault identification algorithm for t/sub I/-diagnosable systems
Structural approach to a system-level fault model
Thesis/Dissertation
·
Sat Dec 31 23:00:00 EST 1988
·
OSTI ID:6046358
A fault identification algorithm for t/sub I/-diagnosable systems
Journal Article
·
Tue Dec 31 23:00:00 EST 1985
· IEEE Trans. Comput.; (United States)
·
OSTI ID:5652778
Structural approach to a system-level fault model
Thesis/Dissertation
·
Wed Dec 31 23:00:00 EST 1986
·
OSTI ID:7245039