This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Diagnosis and the System User
January 1988 (vol. 37 no. 1)
pp. 71-78
The problem of how a user incapable of performing tests can diagnose a system, given the results of the Kuhl and Reddy algorithm, (1980 (3 paper), 1981), is addressed. In particular, the authors provide optimal or near-optimal algorithms for this purpose under a variety of assumptions.

[1] J. A. Bondy and U. S. R. Murty,Graph Theory with Applications. New York: American Elsevier, 1976.
[2] 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.
[3] H. Fujiwara and K. Kinoshita, "On the computational complexity of system diagnosis,"IEEE Trans. Comput., vol. C-27, pp. 881-885, 1978.
[4] M. R. Garey and D. S. Johnson,Computers and Intractability. San Francisco, CA: Freeman, 1979.
[5] C. S. Holt and J. E. Smith, "Self-diagnosis in distributed systems,"IEEE Trans. Comput., vol. C-34, pp. 19-32, 1985.
[6] S. E. Kreutzer and S. L. Hakimi, "Determining diagnosability number," submitted for publication.
[7] J. G. Kuhl, "Fault-diagnosis in computing networks," Ph.D. dissertation, Dep. Elec. Comput. Eng., Univ. Iowa, Iowa City, IA, Aug. 1980.
[8] J. G. Kuhl and S. M. Reddy, "Distributed fault-tolerance for large multiprocessor system," inProc. 1980 Comput. Architecture Conf., France, May 1980.
[9] J. G. Kuhl and S. M. Reddy, "Some extension to the theory of system level fault diagnosis," inProc. IEEE Symp. Fault-Tolerant Comput., 1980, pp. 291-296.
[10] J. G. Kuhl and S. M. Reddy, "Fault-diagnosis in fully distributed systems," inProc. IEEE Symp. Fault-Tolerant Comput., 1981, pp. 100-105.
[11] 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, 1967.
[12] J. D. Russell and C. R. Kime, "System fault diagnosis, masking exposure, and diagnosability without repair,"IEEE Trans. Comput., vol. C-24, pp. 1155-1161, 1975.
[13] G. F. Sullivan, "A polynomial time algorithm for fault diagnosability," inProc. Foundations Comput. Sci., 1984, pp. 148-156.

Index Terms:
Kuhl-Reddy algorithm; distributed diagnosis; system user; near-optimal algorithms; computer testing; directed graphs; distributed processing; switching networks.
Citation:
S.E. Kreutzer, S.L. Hakimi, "Distributed Diagnosis and the System User," IEEE Transactions on Computers, vol. 37, no. 1, pp. 71-78, Jan. 1988, doi:10.1109/12.75141
Usage of this product signifies your acceptance of the Terms of Use.