A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Graphs and Hypergraphs
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
Diagnosable Systems for Intermittent Faults
IEEE Transactions on Computers
Diagnosis Without Repair for Hybrid Fault Situations
IEEE Transactions on Computers
A Theory of Diagnosability of Digital Systems
IEEE Transactions on Computers
Greedy Diagnosis of Hybrid Fault Situations
IEEE Transactions on Computers
An Algorithm for Determining the Fault Diagnosability of a System
IEEE Transactions on Computers
The Comparison Approach to Multiprocessor Fault Diagnosis
IEEE Transactions on Computers
A Framework for Identifying Compromised Nodes in Wireless Sensor Networks
ACM Transactions on Information and System Security (TISSEC)
| Hi-index | 14.99 |
Multiple-unit computer systems which are to be tolerant of intermittently faulty units or transiently upset units are considered in this paper. Designs for such systems, which exploit a new so-called greedy diagnosis theory, are developed. Using greedy diagnosis, assessments on the condition of a unit (intermittent-fault case) or the integrity of data (transient-upset case) can be made on the basis of syndromes formed from comparisons of the results of jobs performed by pairs of units. Greedy diagnosis avoids the requirement that for such syndromes to be useful, they must be interpretable from a permanent-fault/continuous-upset perspective.