This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Diagnosability of Enhanced Hypercubes
September 1994 (vol. 43 no. 9)
pp. 1054-1061

An enhanced hypercube is obtained by adding 2/sup n-1/ more links to a regular hypercube of 2/sup n/ processors. It has been shown that enhanced hypercubes have very good improvements over regular hypercubes in many measurements such as mean internode distance, diameter and traffic density. This paper proves that in the aspect of diagnosability, enhanced hypercubes also achieve improvements. Two diagnosis strategies, both using the well-known PMC diagnostic model, are studied: the precise (one-step) strategy proposed by Preparata, Metze and Chien (1967), and the pessimistic strategy proposed by Friedman (1975). Under the precise strategy, the diagnosability is shown to be increased to n+1 in enhanced hypercubes. (In regular hypercubes, the diagnosability is n under this strategy). Under the pessimistic strategy, the diagnosability is shown to be increased to 2n. (In regular hypercubes, the diagnosability under this strategy is 2n-2). Since the failure probability of one node is fairly low nowadays, so that the increase of diagnosability by one or two will considerably enhance the system's self-diagnostic capability, and considering the fact that diagnosability does not "easily" increase as the links in networks do, these improvements are noticeable.

[1] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleanncube array of microprocessors,"IEEE Trans. Comput., vol. C-30, no. 8, pp. 587-590, 1981.
[2] K. Y. Chwa and S. L. Hakimi, "On fault identification in diagnosable systems,"IEEE Trans. Comput., vol. C-30, no. 6, pp. 414-422, 1981.
[3] A. D. Friedman, "A new measure of digital system diagnosis," inProc. 5th Int. Symp, Fault-Tolerant Comput., 1975, pp. 167-170.
[4] S. L. Hakimi and A. T. Amin, "Characterization of the connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, no. 1, pp. 86-88, 1974.
[5] A. Kavianpour and K. H. Kim, "Diagnosabilities of Hypercubes under the pessimistic one-step diagnosis strategy,"IEEE Trans. Comput., vol. 40, no. 2, pp. 232-237, 1991.
[6] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[7] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, no. 12, pp. 848-854, 1967.
[8] N.-F. Tzeng and S. Wei, "Enhanced hypercubes,"IEEE Trans. Comput., vol. 40, no. 3, pp. 284-294, 1991.
[9] D. Wang, "A note on 'Diagnosabilities of hypercubes under the pessimistic one-step diagnosis strategy,'"ACM Computer Architecture News, vol. 21, no. 5, pp. 71-78, 1993.
[10] H. Whitney, "Congruent graphs and the connectivity of graphs,"Amer. J. Math., vol. 54, pp. 150-168, 1932.
[11] C.-L. Yang, G. M. Masson, and R. A. Leonetti, "On fault identification int1/t1-diagnosable systems,"IEEE Trans. Comput., vol. C-35, pp. 639-643, July 1986.

Index Terms:
hypercube networks; fault tolerant computing; failure analysis; enhanced hypercubes; diagnosability; mean internode distance; diameter; traffic density; PMC diagnostic model; precise strategy; pessimistic strategy; failure probability; self-diagnostic capability; network links; fault tolerance; graph theory; multicomputer networks.
Citation:
Dajin Wang, "Diagnosability of Enhanced Hypercubes," IEEE Transactions on Computers, vol. 43, no. 9, pp. 1054-1061, Sept. 1994, doi:10.1109/12.312114
Usage of this product signifies your acceptance of the Terms of Use.