An O(n2.5) Fault Identification Algorithm for Diagnosable Systems

IEEE Transactions on Computers

Volumn C-33, Issue 6, 1984, Pages 486-492

  Masson, Gerald M ^a   Dahbura, Anton T ^b  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Connection assignment; diagnosis; fault tolerance; matchings; permanent fault; PMC models; self diagnosable systems; syndrome; vertex cover sets

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - FAULT TOLERANT CAPABILITY;

COMPUTER PROGRAMMING;

EID: 0021445280     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/TC.1984.1676472     Document Type: Article

References (28)

1. 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.
2. S. L. Hakimi and A. T. Amin, “Characterization of the connection assignment of diagnosable systems,” IEEE Trans. Comput., vol. C-23, pp. 86–88, Jan. 1974.
3. S. L. Hakimi, S. N. Maheshwari, and A. T. Amin, “On a graph model of diagnosable systems,” in Modeling and Simulation, Proc. 4th Annu. Pittsburgh Conf., Pittsburgh, PA, vol. 4, Apr. 1973, pp. 220–223.
4. F. J. Allan, T. Kameda, and S. Toida, “An approach to the diagnosability analysis of a system,” IEEE Trans. Comput., vol. C-25, pp. 1040–1042, Oct. 1975.
5. T. Kohda, “On one-step diagnosable systems containing at most t faulty units,” Syst. Comput. Controls, vol. 9, no. 5, 1978.
6. J. D. Russell and C. R. Kime, “System fault diagnosis: Masking, exposure, and diagnosability without repair,” IEEE Trans. Comput., vol. C-24, pp. 1156–1161, Dec. 1975.
7. T. Kameda, S. Toida, and F. J. Allan, “A diagnosing algorithm for networks,” Informat. Contr., vol. 29, pp. 141–148, 1975.
8. F. Barsi, F. Grandoni, and P. Maestrini, “A theory of diagnosability in digital systems,” IEEE Trans. Comput., vol. C-25, pp. 585–593, June 1976.
9. A. M. Corluhan and S. L. Hakimi, “On an algorithm for identifying faults in a t-diagnosable system,” in Proc. 1976 Conf. on Informat. Sci. Syst., The Johns Hopkins Univ., Baltimore, MD, pp. 370–375, Apr. 1976.
10. P. Maestrini, “Complexity aspects of system diagnosis,” in Proc. 17th Annu. Allerton Conf. on Commun., Contr., and Comput., Allerton House, Monticello, IL, Oct. 1979, pp. 329–338.
11. R. F. Madden, “On fault-set identification in some system level diagnostic models,” in Proc. 1977 Symp. on Fault Tolerant Comp., IEEE Comput. Soc. Publ., p. 204, June 1977; also, personal correspondence, Jan. 1983.
12. H. Fujiwara and K. Kinoshita, “On the computational complexity of system diagnosis,” IEEE Trans. Comput., vol. C-27, pp. 881–885, Oct. 1978.
13. G.G.L. Meyer and G.M. Masson, “An efficient fault diagnosis algorithm for symmetric multiple processor architectures,” IEEE Trans. Comput., vol. C-27, pp. 1059–1063, Nov. 1978.
14. S. Mallela, “On diagnosable systems with simple algorithms,” in Proc. 1980 Conf. on Informat. Sci. Syst., Princeton Univ., Princeton, NJ, Mar. 1980, pp. 545–549.
15. K. Y. Chwa and S. L. Hakimi, “On fault identification in diagnosable systems,” IEEE Trans. Comput., vol. C-30, pp. 414–422, June 1981.
16. G.G.L. Meyer, “A fault diagnosis algorithm for asymmetric modular architectures,” IEEE Trans. Comput., vol. C-30, pp. 81–83, Jan. 1981.
17. S. L. Hakimi and K. Y. Chwa, “Schemes for fault tolerant computing: A comparison of modularly redundant and t-diagnosable systems,” Informat. Contr., vol. 49, pp. 212–238, June 1981.
18. G.G.L. Meyer, “The PMC system level fault model: Maximality properties of the implied faulty sets,” in Proc. 1983 Conf. on Informat. Sci. Syst., The Johns Hopkins Univ., Baltimore, MD, Mar. 1983, pp. 443–449.
19. A. T. Dahbura and G. M. Masson, “Self-implicating structures for diagnosable systems,” in Proc. 1983 Symp. on Fault Tolerant Comp., IEEE Comput. Soc. Publ., pp. 332–335, June 1983.
20. “An efficient diagnosis algorithm for t-diagnosable systems,” in Proc. 1983 Conf. on Informat. Sci. Syst., The Johns Hopkins Univ., Baltimore, MD, Mar. 1983, pp. 357–360.
21. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. New York: Elsevier North-Holland, 1976.
22. J. E. Hopcroft and R. M. Karp, “An n2.5 algorithm for maximum matchings in bipartite graphs,” SIAM J. Comput., vol. 2, no. 4, Dec. 1973.
23. S. Even and O. Kariv, “An 0(n2.5) algorithm for maximum matching in general graphs,” in Proc. 16th Annu. Symp. on Found, of Comput. Sci., IEEE Comput. Soc. Pub., Oct. 1975, pp. 100–112.
24. S. Micali and V. V. Vazirani, “An 0(V[v[|E|) algorithm for finding maximum matching in general graphs,” in Proc. 21st Annu. Symp. on Found, of Comp. Sci., IEEE Comput. Soc. Pub., pp. 17–27, Oct. 1980.
25. M. R. Garey and D.S. Johnson, Computers and Intractibility. San Francisco, CA: Freeman, 1979.
26. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Reading, MA: Addison-Wesley.
27. D. Coppersmith and S. Winograd, “On the asymptotic complexity of matrix multiplication-extended summary,” in Proc. 22nd Annu. Symp. Found, of Comput. Sci., IEEE Comput. Soc. Publ., Oct. 1981, pp. 82–90.
28. V. L. Arlazarov, E. A. Dinic, M.A. Kronrod, and I. A. Faradzev, “On economical construction of the transitive closure of a directed graph” (English translation), Soviet Math. Dokl., vol. 11, pp. 1209–1210, 1970.