Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model

Authors:
Sun-Yuan Hsieh;Chia-Wei Lee
Affiliations:
National Cheng Kung University, Tainan;National Cheng Kung University, Tainan
Venue:
IEEE Transactions on Dependable and Secure Computing
Year:
2011

Citing 0
Cited 5

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 general technique to establish the asymptotic conditional diagnosability of interconnection networks

Theoretical Computer Science
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
Conditional diagnosability of balanced hypercubes under the MM∗ model

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Diagnosability is an important metric for measuring the reliability of multiprocessor systems. In this paper, we study the diagnosability of a class of networks, called Two-Matching Composition Networks (2-MCNs), each of which is constructed by connecting two graphs via two perfect matchings. By applying our result to multiprocessor systems, we also compute the diagnosability of folded hypercubes and augmented cubes, both of which belong to two-matching composition networks.