Advertisement

t/s-Diagnosable systems: A characterization and diagnosis algorithm

  • A. Das
  • K. Thulasiraman
  • V. K. Agarwal
  • K. B. Lakshmanan
Distribution And Graphs
Part of the Lecture Notes in Computer Science book series (LNCS, volume 411)

Abstract

A classical PMC multiprocessor system [1] composed of n units is said to be t/s-diagnosable

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Preparata, F.P., Metze, G., Chlen, R.T., "On the Connection Asslgnment Problem of Diagnosable Systems," IEEE Trans. Electr. Compt., vol EC-16, pp. 848–854, Dec 1967.Google Scholar
  2. [2]
    Hakimi, S.L., Amin, A., "Characterization of the Connection Assignment of Diagnosable Systems," IEEE Trans. Comp., vol C-23, pp 86–88, Jan 1974.Google Scholar
  3. [3]
    Sullivan, G.F., "A Polynomial Time Algorithm for Fault Diagnosability," In Proc. 25th Annu. Symp. Foundations Comp. Sc., pp. 148–156, Oct 1984.Google Scholar
  4. [4]
    Dahbura, A.T., Masson, G.M., "A Practical Variation of the O(n 2.5) Fault Diagnosis Algorithm," In 14th Int. Symp. Fault-Tolerant Comput., 1984.Google Scholar
  5. [5]
    Sullivan, G.F., "An O(t 3+|E|) Fault Identification Algorithm for Diagnosable Systems," IEEE Trans. Comp., vol C-37, pp. 388–397, April 1988.CrossRefMathSciNetGoogle Scholar
  6. [6]
    Friedman, A.D., "A New Measure of Digital System Diagnosis," In Dig. 1975 Int. Symp. Fault-Tolerant Comput., pp. 167–170, June 1975.Google Scholar
  7. [7]
    Kavianpour, A., Friedman, A.D., "Efficient Design of Easily Diagnosable Systems," In Proc. 3rd USA-Japan Comput. Conf., pp. 251–257, 1978.Google Scholar
  8. [8]
    Chwa, K.Y., Hakimi, S.L., "On Fault Identification in Diagnosable Systems," IEEE Trans. Comp., vol. C-30, pp. 414–422, June 1981.Google Scholar
  9. [9]
    Yang, C.L., Masson, G.M., Leonetti, R.A., "On Fault Identification and Isolation in t 1/t 2-Diagnosable Systems," IEEE Trans. Comp., vol C-35, pp. 639–643, July 1986.Google Scholar
  10. [10]
    Sullivan, G., "The Complexity of System-Level Fault Diagnosis and Diagnosability," Ph.D. Dissertation, Yale University, 1986.Google Scholar
  11. [11]
    Bondy, J.A., Murty, U.S.R., Graph Theory with Applications, New York: Elsevier North-Holland 1976.Google Scholar
  12. [12]
    Hopcroft, J.E., Karp, R.M., "A n 2.5 algorithm for maximum matching in bipartite graphs," SIAM J. Comput., vol. 2, Dec 1973.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • A. Das
    • 1
  • K. Thulasiraman
    • 1
  • V. K. Agarwal
    • 2
  • K. B. Lakshmanan
    • 3
  1. 1.E.E. Dept.Concordia UniversityMontreal
  2. 2.E.E. Dept.McGill UniversityMontreal
  3. 3.Dept. of Math. and Comp. Sc.SUNYBrockport

Personalised recommendations