Diagnosability of Two-Matching Composition Networks

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.

[1]  Jon T. Butler,et al.  A Characterization of t/s-Diagnosability an Sequential t-Diagnosability in Designs , 1990, IEEE Trans. Computers.

[2]  Abhijit Sengupta,et al.  On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach , 1992, IEEE Trans. Computers.

[3]  Arun K. Somani.  Sequential Fault Occurrence and Reconfiguration in System Level Diagnosis , 1990, IEEE Trans. Computers.

[4]  Gerard J. Chang,et al.  Diagnosabilities of regular networks , 2005, IEEE Transactions on Parallel and Distributed Systems.

[5]  Yukio Shibata,et al.  Diagnosability of Butterfly Networks under the Comparison Approach , 2002, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[6]  Vinod K. Agarwal,et al.  Diagnosis of t/(t+1)-Diagnosable Systems , 1994, SIAM J. Comput..

[7]  Gerard J. Chang,et al.  (t, k) - Diagnosis for Matching Composition Networks under the MM* Model , 2007, IEEE Transactions on Computers.

[8]  Gerard J. Chang,et al.  (t; k)-Diagnosis for matching composition networks , 2006, IEEE Transactions on Computers.

[9]  Xiaola Lin,et al.  The t/k-diagnosability of the BC graphs , 2005, IEEE Transactions on Computers.

[10]  Kyung-Yong Chwa,et al.  On Fault Identification in Diagnosable Systems , 1981, IEEE Transactions on Computers.

[11]  Dajin Wang.  Diagnosability of Hypercubes and Enhanced Hypercubes under the Comparison Diagnosis Model , 1999, IEEE Trans. Computers.

[12]  Yukio Shibata,et al.  (t, k)-Diagnosable System: A Generalization of the PMC Models , 2003, IEEE Trans. Computers.

[13]  Miroslaw Malek,et al.  A comparison connection assignment for diagnosis of multiprocessor systems , 1980, ISCA '80.

[14]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[15]  Jianxi Fan.  Diagnosability of the Möbius Cubes , 1998, IEEE Trans. Parallel Distributed Syst..

[16]  Arun K. Somani,et al.  On Diagnosability of Large Fault Sets in Regular Topology-Based Computer Systems , 1996, IEEE Trans. Computers.

[17]  Shahram Latifi,et al.  Properties and Performance of Folded Hypercubes , 1991, IEEE Trans. Parallel Distributed Syst..

[18]  James R. Armstrong,et al.  Fault Diagnosis in a Boolean n Cube Array of Microprocessors , 1981, IEEE Transactions on Computers.

[19]  Vinod K. Agarwal,et al.  A Generalized Theory for System Level Diagnosis , 1987, IEEE Transactions on Computers.

[20]  Jianxi Fan,et al.  Diagnosability of Crossed Cubes under the Comparison Diagnosis Model , 2002, IEEE Trans. Parallel Distributed Syst..

[21]  Che-Liang Yang,et al.  On Fault Isolation and Identification in t1/t1-Diagnosable Systems , 1986, IEEE Transactions on Computers.

[22]  K. H. Kim,et al.  Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy , 1991, IEEE Trans. Computers.