System-level fault diagnosis and reconfiguration
The classical fault-diagnosis model assumes that faults are permanent and each test, administered by a unit, is complete for the unit being tested. These two assumptions may restrict the applicability of the model. The author introduces a new deterministic fault model for system-level fault diagnosis. Unlike earlier attempts, his model intermittent faults, incomplete testing by units, and fault masking in a uniform manner. He obtains necessary and sufficient conditions for a system to be diagnosable using the new fault model. The complexity of the diagnosability problem in the model is shown to be co-NP-complete. He then examines the problem of system reconfiguration following identification of faulty components. In particular, reconfigurability of multipipelines is considered in detail. He alternates the pipeline stages with testing and reconfiguring circuitry. The pipelines are reconfigured by programming the switches in a distributed manner. The switch programming algorithm is optimal in the sense that it recovers the maximum number of pipelines under any fault pattern. A proof of its optimality is also presented.
- Research Organization:
- Stanford Univ., CA (USA). Plasma Gasdynamics Lab.
- OSTI ID:
- 6992825
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fault diagnosis in computing networks
Complexity of system-level fault diagnosis and diagnosability
Related Subjects
DIGITAL SYSTEMS
FAULT TREE ANALYSIS
FAULT TOLERANT COMPUTERS
ALGORITHMS
OPTIMIZATION
PROGRAMMING
COMPUTERS
DIGITAL COMPUTERS
MATHEMATICAL LOGIC
SYSTEM FAILURE ANALYSIS
SYSTEMS ANALYSIS
990210* - Supercomputers- (1987-1989)