Subscribe

Issue No.02 - March/April (2011 vol.8)

pp: 246-255

Chia-Wei Lee , National Cheng Kung University, Tainan

Sun-Yuan Hsieh , National Cheng Kung University, Tainan

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TDSC.2009.52

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.

INDEX TERMS

Comparison diagnosis model, diagnosability, graph theory, two-matching composition networks, MM{}^{\ast} model, multiprocessor systems.

CITATION

Chia-Wei Lee, Sun-Yuan Hsieh, "Diagnosability of Two-Matching Composition Networks under the MM{}^{\ast} Model",

*IEEE Transactions on Dependable and Secure Computing*, vol.8, no. 2, pp. 246-255, March/April 2011, doi:10.1109/TDSC.2009.52REFERENCES