This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diagnosability of Crossed Cubes under the Comparison Diagnosis Model
October 2002 (vol. 13 no. 10)
pp. 1099-1104

Abstract—Diagnosability of a multiprocessor system is one important study topic in the parallel processing area. As a hypercube variant, the crossed cube has many attractive properties. The diameter, wide diameter and fault diameter of it are all approximately half of those of the hypercube. The power that the crossed cube simulates trees and cycles is stronger than the hypercube. Because of these advantages of the crossed cube, it has attracted much attention from researchers. In this paper, we show that the n-dimensional crossed cube is n-diagnosable under a major diagnosis model—the comparison diagnosis model proposed by Malek and Maeng if n\geq 4. According to this, the polynomial algorithm presented by Sengupta and Dahbura may be used to diagnose the n-dimensional crossed cube, provided that the number of the faulty nodes in the n-dimensional crossed cube does not exceed n. The conclusion of this paper also indicates that the diagnosability of the n-dimensional crossed cube is the same as that of the n-dimensional hypercube when n\geq 5 and better than that of the n-dimensional hypercube when n=4.

[1] M. Malek, “A Comparison Connection Assignment for Diagnosis of Multiprocessor Systems,” Proc. Seventh Int'l Symp. Computer Architecture, pp. 31-35, 1980.
[2] J. Maeng and M. Malek, “A Comparison Connection Assignment for Self-Diagnosis of Multiprocessor Systems,” Proc. 11th Int'l Symp. Fault-Tolerant Computing, pp. 173-175, 1981.
[3] A. Sengupta and A. Dahbura, “On Self-Diagnosable Multiprocessor Systems: Diagnosis by the Comparison Approach,” IEEE Trans. Computers, vol. 41, no. 11, pp. 1386-1396, Nov. 1992.
[4] K. Efe, “A Variation on the Hypercube with Lower Diameter,” IEEE Trans. Computers, vol. 40, no. 11, pp. 1312-1316, Nov. 1991.
[5] K. Efe, “The Crossed Cube Architecture for Parallel Computing,” IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 5, pp. 513-524, Sept.-Oct. 1992.
[6] K. Efe, P.K. Blackwell, W. Slough, and T. Shiau, “Topological Properties of the Crossed Cube Architecture,” Parallel Computing, vol. 20, pp. 1763-1775, 1994.
[7] P. Kulasinghe and S. Bettayeb, “Embedding Binary Trees into Crossed Cubes,” IEEE Trans. Computers, vol. 44, no. 7, pp. 923-929, July 1995.
[8] P. Kulasinghe, “Connectivity of the Crossed Cube,” Information Processing Letters, vol. 61, pp. 221-226, Feb. 1997.
[9] S.-Q. Zheng and S. Lattifi, “Optimal Simulation of Linear Multiprocessor Architectures on Multiply-Twisted Cube Using Generalized Gray Code,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 6, pp. 612-619, June 1996.
[10] C.-P. Chang, T.-Y. Sung, and L.-H. Hsu, “Edge Congestion and Topological Properties of Crossed Cubes,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 1, pp. 64-80, Jan. 2000.
[11] F.P. Preparata, G. Metze, and R.T. Chien, “On the Connection Assignment Problem of Diagnosis Systems,” IEEE Trans. Electronic Computers, vol. 16, no. 12, pp. 848-854, Dec. 1967.
[12] D. Wang, “Diagnosability of Hypercubes and Enhanced HyperCubes under the Comparison Diagnosis Model,” IEEE Trans. Computers, vol. 48, no. 12, pp. 1369-1374, Dec. 1999.
[13] J.R. Armstrong and F.G. Gray, “Fault Diagnosis in a BooleannCube Array of Multiprocessors,” IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
[14] A. Kavianpour and K.H. Kim, “Diagnosability of Hypercube under the Pessimistic One-Step Diagnosis Strategy,” IEEE Trans. Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991.
[15] J. Fan, “Diagnosability of Crossed Cubes under the Two Strategies,” Chinese J. Computers, vol. 21, no. 5, pp. 456-462, May 1998.

Index Terms:
Diagnosability, comparison diagnosis model, diagnosis, crossed cube, hypercube, multiprocessor system.
Citation:
Jianxi Fan, "Diagnosability of Crossed Cubes under the Comparison Diagnosis Model," IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 10, pp. 1099-1104, Oct. 2002, doi:10.1109/TPDS.2002.1041887
Usage of this product signifies your acceptance of the Terms of Use.