This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diagnosability of the Möbius Cubes
September 1998 (vol. 9 no. 9)
pp. 923-928

Abstract—The recently introduced interconnection networks, the Möbius cubes, are hypercube variants that have some better properties than hypercubes. The n-dimensional Möbius cube Mn is a regular graph with 2n nodes and n2n−1 edges. The diameter of Mn is about one half that of the n-dimensional hypercube Qn and the average number of steps between nodes for Mn is about two-thirds of the average for Qn, and 1 $-$Mn has dynamic performance superior to that of Qn [1]. Of course, the symmetry of Mn is not superior to that of Qn, i.e., Qn is both node symmetric and edge symmetric [11], whereas Mn is, in general, neither node symmetric (n≥ 4) nor edge symmetric (n≥ 3) [1]. In this paper, we study the diagnosability of Mn. We use two diagnosis strategies, both based on the so-called PMC diagnostic model—the precise (one-step) diagnosis strategy proposed by Preparata et al. [10] and the pessimistic diagnosis strategy proposed by Friedman [9]. We show that the diagnosability of Mn is the same as that of Qn, i.e., Mn is n-diagnosable under the precise diagnosis strategy and (2n$-$ 2)/(2n$-$ 2)-diagnosable under the pessimistic diagnosis strategy.

[1] P. Cull and S.M. Larson, The Möbius Cubes IEEE Trans. Computers, vol. 44, no. 5, pp. 647-659, May 1995.
[2] C.L. Yang, G.M. Masson, and R.A. Leoneti, "On Fault Isolation and Identification in t1/t1-Diagnosable Systems," IEEE Trans. Computers, vol. 35, no. 7, pp. 639-643, July 1986.
[3] J.R. Armstrong and F.G. Gray, "Fault Diagnosis in a Boolean n-Cube Array of Multiprocessors," IEEE Trans. Computers, vol. 30, no. 8, pp. 587-590, Aug. 1981.
[4] S.L. Hakimi and E.F. Schmeichel, "An Adaptive Algorithm for System Level Diagnosis," J. Algorithms, no. 5, pp. 526-530, 1984.
[5] S.L. Hakimi and A.T. Amin, "Characterization of the Connection Assignment of Diagnosable Systems," IEEE Trans. Computers, vol. 23, no. 1, pp. 86-88, Jan. 1974.
[6] S.L. Hakimi and K. Nakajima, "On Adaptive System Diagnosis," IEEE Trans. Computers, vol. 33, no. 3, pp. 234-240, Mar. 1984.
[7] K.Y. Chwa and S.L. Hakimi, "On Fault Identification in Diagnosable Systems," IEEE Trans. Computers, vol. 30, no. 6, pp. 414-422, June 1981.
[8] D. Wang, “Diagnosability of Enhanced Hypercubes,” IEEE Trans. Computers, vol. 43, no. 9, pp. 1,054-1,061, Sept. 1994.
[9] A.D. Friedman, "A New Measure of Digital System Diagnosis," Proc. Fifth Int'l Symp. Fault-Tolerant Computing, pp. 167-170, 1975.
[10] F.P. Preparata, G. Metze, and R.T. Chien, "On the Connection Assignment Problem of Diagnosable Systems," IEEE Trans. Electronic Computers, vol. 16, no. 12, pp. 848-854, Dec. 1967.
[11] S.B. Akers and B. Krishnamurthy, “A Group-Theoretic Model for Symmetric Interconnection Networks,” IEEE Trans. Computers, vol. 38, no. 4, pp. 555-566, Apr. 1989.
[12] H. Whitney, "Congruent Graphs and the Connectivity of Graphs," Am. J. Math., vol. 54, pp. 150-168, 1932.
[13] A. Dahbura, K. Sabnani, and L. King, "The Comparison Approach to Multiprocessor Fault Diagnosis," IEEE Trans. Computers, vol. 36, no. 3, pp. 373-378, Mar. 1987.
[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.

Index Terms:
The Möbius cube, diagnosis, diagnosability, hypercube, multiprocessor system.
Citation:
Jianxi Fan, "Diagnosability of the Möbius Cubes," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 9, pp. 923-928, Sept. 1998, doi:10.1109/71.722224
Usage of this product signifies your acceptance of the Terms of Use.