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

Consider a system composed of n independent processors, each of which tests a subset of the others. It is assumed that at most tp of these processors are permanently faulty and that the outcome of a test is reliable if and only if the processor which performed the test is fault free. Such a system is said to be tp-diagnosable if, given any complete collection of test results, the set of faulty processors can be uniquely identified. In this paper, it is shown that tp-diagnosable systems, due to their robust interconnection structure, possess heretofore unknown graph theoretic properties relative to vertex cover sets and maximum matchings. An 0(n2.5) algorithm is given which exploits these properties to identify the set of faulty processors in a tp-diagnosable system. The algorithm is shown to be correct, complete, not based on any conjecture, and superior to any other known fault identification algorithm for the general class of tp-diagnosable systems.

[1]  S. Winograd,et al.  On the asymptotic complexity of matrix multiplication , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2]  S. Louis Hakimi,et al.  Characterization of Connection Assignment of Diagnosable Systems , 1974, IEEE Transactions on Computers.

[3]  Tiko Kameda,et al.  An Approach to the Diagnosability Analysis of a System , 1975, IEEE Transactions on Computers.

[4]  Che-Liang Yang,et al.  Self-Implicating Structures for Diagnosable Systems , 1985, IEEE Transactions on Computers.

[5]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[6]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[7]  Kyung-Yong Chwa,et al.  On Fault Identification in Diagnosable Systems , 1981, IEEE Transactions on Computers.

[8]  Gerald M. Masson,et al.  Diagnosable Systems for Intermittent Faults , 1978, IEEE Transactions on Computers.

[9]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[10]  Fabrizio Grandoni,et al.  A Theory of Diagnosability of Digital Systems , 1976, IEEE Transactions on Computers.

[11]  Charles R. Kime,et al.  System Fault Diagnosis: Masking, Exposure, and Diagnosability Without Repair , 1975, IEEE Transactions on Computers.

[12]  Uppaluri S. R. Murty,et al.  Graph Theory with Applications , 1978 .

[13]  Shimon Even,et al.  An O (N2.5) algorithm for maximum matching in general graphs , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[14]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[15]  Gerard G. L. Meyer.  A fault diagnosis algorithm for asymmetric modular architectures , 1981, IEEE Transactions on Computers.

[16]  Kozo Kinoshita,et al.  On the Computational Complexity of System Diagnosis , 1978, IEEE Transactions on Computers.

[17]  Gerald M. Masson,et al.  An Efficient Fault Diagnosis Algorithm for Symmetric Multiple Processor Architectures , 1978, IEEE Transactions on Computers.

[18]  Don Coppersmith,et al.  On the Asymptotic Complexity of Matrix Multiplication (Extended Summary) , 1981, FOCS 1981.

[19]  S. Louis Hakimi,et al.  On an Algorithm for Identifying Faults in a T-Diagnosable System, , 1976 .

[20]  Tiko Kameda,et al.  A Diagnosing Algorithm for Networks , 1975, Inf. Control..

[21]  Kyung-Yong Chwa,et al.  Schemes for Fault-Tolerant Computing: A Comparison of Modularly Redundant and t-Diagnosable Systems , 1981, Inf. Control..

[22]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .