Strongly Diagnosable Product Networks Under the Comparison Diagnosis Model

The notion of diagnosability has long played an important role in measuring the reliability of multiprocessor systems. Such a system is t-diagnosable if all faulty nodes can be identified without replacement when the number of faults does not exceed t, where t is some positive integer. Furthermore, a system is strongly i-diagnosable if it can achieve (t + 1)-diagnosability, except for the case where a node's neighbors are all faulty. In this paper, we investigate the strong diagnosability of a class of product networks, under the comparison diagnosis model. Based on our results, we can determine the strong diagnosability of several widely used multiprocessor systems, such as hypercubes, mesh-connected k-ary n-cubes, torus-connected k-ary n-cubes, and hyper-Petersen networks.

[1]  Dajin Wang,et al.  Diagnosability of Enhanced Hypercubes , 1994, IEEE Trans. Computers.

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

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

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

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

[6]  Abdel Elah Al-Ayyoub,et al.  Minimal Fault Diameter for Highly Resilient Product Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[7]  Sabine R. Öhring,et al.  Optimal fault-tolerant communication algorithms on product networks using spanning trees , 1994, Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing.

[8]  Sabine R. Öhring,et al.  Embeddings Into Hyper Petersen Networks: Yet Another Hypercube-Like Interconnection Topology , 1995 .

[9]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[10]  Yukio Shibata,et al.  Diagnosability of Networks Represented by the Cartesian Product (Special Section of Selected Papers from the 12th Workshop on Circuit and Systems in Karuizawa) , 2000 .

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

[12]  Yaagoub Ashir,et al.  Lee Distance and Topological Properties of k-ary n-cubes , 1995, IEEE Trans. Computers.

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

[14]  Antonio Fernández,et al.  Products of Networks with Logarithmic Diameter and Fixed Degree , 1995, IEEE Trans. Parallel Distributed Syst..

[15]  Sanjeev Khanna,et al.  A Graph Partitioning Approach to Sequential Diagnosis , 1997, IEEE Trans. Computers.

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

[17]  Biing-Feng Wang,et al.  Constructing Edge-Disjoint Spanning Trees in Product Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[18]  Arnold L. Rosenberg,et al.  Product-Shuffle Networks: Toward Reconciling Shuffles and Butterflies , 1992, Discret. Appl. Math..

[19]  Lih-Hsing Hsu,et al.  Diagnosability of t-connected networks and product networks under the comparison diagnosis model , 2004, IEEE Transactions on Computers.

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

[21]  Bih-Sheue Shieh,et al.  On connectivity of the Cartesian product of two graphs , 1999, Appl. Math. Comput..

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

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

[24]  Abdou Youssef,et al.  A general framework for developing adaptive fault-tolerant routing algorithms , 1993 .

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

[26]  Abdel Elah Al-Ayyoub,et al.  The Cross Product of Interconnection Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[27]  Dharma P. Agrawal,et al.  Generalized Hypercube and Hyperbus Structures for a Computer Network , 1984, IEEE Transactions on Computers.

[28]  Douglas M. Blough,et al.  Efficient Diagnosis of Multiprocessor Systems under Probabilistic Models , 1992, IEEE Trans. Computers.

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

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

[31]  Kozo Kinoshita,et al.  On the Computational Complexity of System Diagnosis , 1978, IEEE Transactions on Computers.

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

[33]  Saïd Bettayeb.  On the k-ary Hypercube , 1995, Theor. Comput. Sci..

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

[35]  M. H. Schultz,et al.  Topological properties of hypercubes , 1988, IEEE Trans. Computers.

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