Determining the Diagnosability of (1,2)-Matching Composition Networks and Its Applications

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

Citing 0
Cited 1

A general technique to establish the asymptotic conditional diagnosability of interconnection networks

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.