Communications of the ACM - Special section on computer architecture
On Fault Isolation and Identification in t1/t1-Diagnosable Systems
IEEE Transactions on Computers
A Generalized Theory for System Level Diagnosis
IEEE Transactions on Computers
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Distributed Diagnosis Algorithms for Regular Interconnected Structures
IEEE Transactions on Computers
Rearrangeable circuit-switched hypercube architectures for routing permutations
Journal of Parallel and Distributed Computing
Fault-Tolerant Multiprocessor System Routing Using Incomplete Diagnostic Information
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
(t, k)-Diagnosable System: A Generalization of the PMC Models
IEEE Transactions on Computers
The t/k-Diagnosability of the BC Graphs
IEEE Transactions on Computers
Minimum neighborhood in a generalized cube
Information Processing Letters
A (4n-9)/3 diagnosis algorithm on n-dimensional cube network
Information Sciences: an International Journal
Efficient Fault Identification of Diagnosable Systems under the Comparison Model
IEEE Transactions on Computers
Diagnosability of Two-Matching Composition Networks
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Diagnosable evaluation of DCC linear congruential graphs under the PMC diagnostic model
Information Sciences: an International Journal
Local diagnosability of generic star-pyramid graph
Information Processing Letters
One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems
Journal of Systems and Software
Minimum neighborhood in a generalized cube
Information Processing Letters
t/t-Diagnosability of regular graphs under the PMC model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 14.99 |
The classical t-diagnosability approach has its limitation when dealing with large fault sets in large multiprocessor systems. This is due to limited diagnosability of large multiprocessor systems connected using regular interconnection structures. We propose an alternative approach to system diagnosis by allowing a few upper bounded number of units to be diagnosed incorrectly. This measure is called t/k-diagnosability. Using this new measure, it is possible to increase the degree of diagnosability of large system considerably. The t/k-diagnosis guarantees that all the faulty units (processors) in a system are detected (provided the number of faulty units does not exceed t) while at most k units are incorrectly diagnosed. We provide necessary and sufficient conditions for t/k-diagnosability and discuss their implication. To demonstrate the power of this approach, we analyze the diagnosability of large systems connected as hypercube, star-graph, and meshes. It is shown that a substantial increase in the degree of diagnosability of these structures is achieved, compared with the degree of diagnosability achieved using the classic t-diagnosability approach, at the cost of a comparably small number of incorrectly diagnosed units.