Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
IEEE Transactions on Computers
On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach
IEEE Transactions on Computers
Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model
IEEE Transactions on Computers
Diagnosability of Enhanced Hypercubes
IEEE Transactions on Computers
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
IEEE Transactions on Parallel and Distributed Systems
A comparison connection assignment for diagnosis of multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
Diagnosabilities of Regular Networks
IEEE Transactions on Parallel and Distributed Systems
Diagnosability of star graphs under the comparison diagnosis model
Information Processing Letters
Characterization of Connection Assignment of Diagnosable Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
A survey of comparison-based system-level diagnosis
ACM Computing Surveys (CSUR)
Hi-index | 0.89 |
Diagnosability has played an important role in the reliability of multiprocessor systems. The strongly t-diagnosable system is (t+1) diagnosable except when all of the neighbors of a node are simultaneously faulty. In this paper, we discuss the in-depth properties of diagnosability for t-regular and t-connected networks under the comparison model. We show that a t-regular and t-connected multiprocessor system with at least 2t+6 nodes, for t=4, is strongly t-diagnosable under the comparison model if the following two conditions hold: (1) the system is triangle free, and (2) there are at most t-2 common neighbors for each pair of distinct nodes in the system.