This Article 
 Bibliographic References 
 Add to: 
Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy
February 1991 (vol. 40 no. 2)
pp. 232-237

The capabilities of a system-diagnosis technique based on mutual testing are discussed. The technique is applied to hypercube computer systems. A one-step diagnosis of hypercubes that involves only one testing phase, in which processors test each other, is described. Two kinds of one-step diagnosis are presented: the precise one-step diagnosis and the pessimistic one-step diagnosis. Results indicate that the degree of diagnosability of the n-dimensional hypercube (for short, n-cube), where n

[1] J. R. Armstrong and F. G. Gray, "Fault diagnosis in a Booleanncube array of microprocessors,"IEEE Trans. Comput., vol. C-30, pp. 587-590, Aug. 1981.
[2] P. Banerjeeet al., "An evaluation of system-level fault tolerance on the intel hypercube multiprocessor," inProc. 18th Int. Symp. Fault-Tolerant Comput., 1988, pp. 362-367.
[3] K. Y. Chwa and S. L. Hakimi, "On fault identification in diagnosable systems,"IEEE Trans. Comput., vol. C-30, pp. 414-422, June-1981.
[4] A. T. Dahbura and G. M. Masson, "AnO(n2.5) fault identification algorithm for diagnosable systems,"IEEE Trans. Comput., vol. C-33, pp. 486-492, June 1984.
[5] A. T. Dahbura, "System-level diagnosis: A perspective for the third decade," Tech. Rep., AT&T Bell Labs., 1987.
[6] E. Dilger and E. Ammann, "System level self diagnosis in n cube connected multiprocessor networks," inProc. 14th Int. Symp. Fault-Tolerant Comput., 1984, pp. 184-189.
[7] A. D. Friedman, "A new measure of digital system diagnosis," inProc 5th Int. Symp. Fault-Tolerant Comput., 1975, pp. 167-170.
[8] S. L. Hakimi and A. T. Amin, "Characterization of connection assignment of diagnosable systems,"IEEE Trans. Comput., vol. C-23, pp. 86-88, Jan. 1974.
[9] A. Kavianpour, "Diagnosis of digital system using t/t measure," Ph.D. dissertation, Dep. EE-Systems, Univ. of Southern California, June 1978.
[10] A. Kavianpour and A. D. Friedman, "Efficient design of easily diagnosable systems," inProc. 3rd USA-JAPAN Computer Conf., Oct. 1978, pp. 251-257.
[11] A. Kavianpour and A. D. Friedman, "Trade-offs in system level diagnosis of multiprocessor systems," inProc. AFIPS National Comput. Conf., July 1984, pp. 173-181.
[12] C. Kime, "System diagnosis," inFault-Tolerant Computing: Theory and Techniques, D. K. Pradhan, Ed. Englewood Cliffs, NJ: Prentice-Hall, 1985.
[13] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[14] J. Kuhl and S. Reddy, "Fault diagnosis in fully distributed systems," inProc. 11th Int. Symp. Fault-Tolerant Comput., 1981, pp. 100-105.
[15] N. Maxemchuk and A. Dahbura, "Optimal diagnosable system design using full difference triangles,"IEEE Trans. Comput., vol. C-35, pp. 837-839, Sept. 1986.
[16] F. P. Preparata, G. Metze, and R. T. Chien, "On the connection assignment problem of diagnosable systems,"IEEE Trans. Electron. Comput., vol. EC-16, pp. 848-854, Dec. 1967.
[17] A. K. Somani, V. K. Agrawal, and D. Avis, "A generalized theory for system level diagnosis,"IEEE Trans. Comput., vol. C-36, pp. 538-546, May 1987.
[18] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148-156.
[19] H. Whitney, "Congruent graphs and the connectivity of graphs,"Amer. J. Math., vol. 54, pp. 150-168, 1932.
[20] 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:
hypercubes diagnosabilities; pessimistic one-step diagnosis strategy; system-diagnosis technique; mutual testing; n-dimensional hypercube; fault bound; upper bound; bidirectional links; fault tolerant computing; hypercube networks.
A. Kavianpour, K.H. Kim, "Diagnosabilities of Hypercubes Under the Pessimistic One-Step Diagnosis Strategy," IEEE Transactions on Computers, vol. 40, no. 2, pp. 232-237, Feb. 1991, doi:10.1109/12.73595
Usage of this product signifies your acceptance of the Terms of Use.