Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Diagnosis of t/(t +1)-Diagnosable Systems
SIAM Journal on Computing
Multiprocessor Fault Diagnosis Under Local Constraints
IEEE Transactions on Computers
IEEE Transactions on Computers
Conditional Diagnosability Measures for Large Multiprocessor Systems
IEEE Transactions on Computers
An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems
IEEE Transactions on Computers
On conditional diagnosability and reliability of the BC networks
The Journal of Supercomputing
The diagnosability of the matching composition network under the comparison diagnosis model
IEEE Transactions on Computers
Diagnosis of clustered faults and wafer testing
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Determining the conditional diagnosability of k-ary n-cubes under the MM* model
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
A fast fault-identification algorithm for bijective connection graphs using the PMC model
Information Sciences: an International Journal
Theoretical Computer Science
Conditional Diagnosability of k-Ary n-Cubes under the PMC Model
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conditional diagnosability of balanced hypercubes under the PMC model
Information Sciences: an International Journal
Conditional diagnosability of matching composition networks under the MM* model
Information Sciences: an International Journal
| Hi-index | 0.00 |
In the work of Lai et al. in 2005, they proposed a new measure for fault diagnosis of systems, namely, conditional diagnosability. It assumes that no fault set can contain all the neighbors of any vertex in the system. In the same paper, they showed that the conditional diagnosability of hypercube Qn is 4(n - 2) + 1 for n ≥ 5. In this brief, we generalize this result by considering a family of more popular networks, namely, matching composition networks (MCNs), which are a class of networks composed of two components of the same order linked by a perfect matching under PMC (Preparata, Metze and Chien) model. We determine in Theorem 7 the conditional diagnosability for some MCNs, from which we deduce that the hypercube Qn, the crossed cube CQn, the twisted cube TQn, and the Möbius cube MQn all have the same conditional diagnosability of 4(n - 2) + 1 for n ≥ 5. We show that the bijective connection (BC) networks in the work of Fan and He in 2003 and the work of Zhu in 2008 satisfy the conditions of Theorem 7, and thus, our conditional diagnosability result also applies to BC networks. Finally, we show that the MCNs satisfying the conditions of Theorem 7 are more general than the BC networks.