Subscribe

Issue No.03 - May/June (2011 vol.8)

pp: 353-362

Chia-Wei Lee , Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

Sun-Yuan Hsieh , Dept. of Comput. Sci. & Inf. Eng., Nat. Cheng Kung Univ., Tainan, Taiwan

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

ABSTRACT

The classic problem of determining the diagnosability of a given network has been studied extensively. Under the PMC model, this paper addresses the problem of determining the diagnosability of a class of networks called (1,2)-Matching Composition Networks, each of which is constructed by connecting two graphs via one or two perfect matchings. By applying our results to multiprocessor systems, we can determine the diagnosability of hypercubes, twisted cubes, locally twisted cubes, generalized twisted cubes, recursive circulants G(2^{n},4) for odd n, folded hypercubes, augmented cubes, crossed cubes, Möbius cubes, and hyper-Petersen networks, all of which belong to the class of (1,2)-matching composition networks.

INDEX TERMS

multiprocessing systems, fault diagnosis, graph theory, multiprocessor systems, diagnosability, PMC model, (1, 2)-matching composition networks, hypercubes, generalized twisted cubes, augmented cubes, Multiprocessing systems, Hypercubes, Joining processes, Program processors, Fault diagnosis, Routing, Topology, multiprocessor systems., PMC model, diagnosability, graph theory, (1, 2)-matching composition networks

CITATION

Chia-Wei Lee, Sun-Yuan Hsieh, "Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications",

*IEEE Transactions on Dependable and Secure Computing*, vol.8, no. 3, pp. 353-362, May/June 2011, doi:10.1109/TDSC.2010.22REFERENCES