Diagnosability of the Möbius Cubes

The recently introduced interconnection networks, the Mobius cubes, are hypercube variants that have some better properties than hypercubes. The n-dimensional Mobius cube M/sub n/ is a regular graph with 2/sup n/ nodes and n2/sup n-1/ edges. The diameter of M/sub n/ is about one half that of the n-dimensional hypercube Q/sub n/ and the average number of steps between nodes for M/sub n/ is about two-thirds of the average for Q/sub n/, and 1-M/sub n/ has dynamic performance superior to that of Q/sub n/. Of course, the symmetry of M/sub n/ is not superior to that of Q/sub n/, i.e., Q/sub n/ is both node symmetric and edge symmetric , whereas M/sub n/ is, in general, neither node symmetric (n/spl ges/4) nor edge symmetric (n/spl ges/3). In this paper, we study the diagnosability of M/sub n/. 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. (1967) and the pessimistic diagnosis strategy proposed by Friedman (1975). We show that the diagnosability of M/sub n/ is the same as that of Q/sub n/, i.e., M/sub n/ is n-diagnosable under the precise diagnosis strategy and (2n-2)/(2n-2)-diagnosable under the pessimistic diagnosis strategy.

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

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

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

[4]  S. Louis Hakimi,et al.  An Adaptive Algorithm for System Level Diagnosis , 1984, J. Algorithms.

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

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

[7]  H. Whitney Congruent Graphs and the Connectivity of Graphs , 1932 .

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

[9]  Paul Cull,et al.  The Möbius Cubes , 1995, IEEE Trans. Computers.

[10]  S. Louis Hakimi,et al.  On Adaptive System Diagnosis , 1984, IEEE Transactions on Computers.

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

[12]  Sheldon B. Akers,et al.  A Group-Theoretic Model for Symmetric Interconnection Networks , 1989, IEEE Trans. Computers.

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

[14]  Arthur D. Friedman,et al.  Analysis of Digital Systems Using a New Measure of System Diagnosis , 1979, IEEE Transactions on Computers.

[15]  Krishan K. Sabnani,et al.  The Comparison Approach to Multiprocessor Fault Diagnosis , 1987, IEEE Transactions on Computers.