Fault diagnosis in a small constant number of parallel testing rounds

Consider a set of processors, V, that can communicate with each other. Assume that each processor can be either “good” or “faulty”. Also assume that the processors can be used to test each other. We provide a parallel algorithm that determines which processors are good and which are faulty in 32 rounds of testing, pre Tided that a strict majority of the processors are good.

[1]  S. Louis Hakimi,et al.  An Adaptive Algorithm for System Level Diagnosis , 1984, J. Algorithms.

[2]  Udi Manber.  System Diagnosis with Repair , 1980, IEEE Transactions on Computers.

[3]  S. Louis Hakimi,et al.  On minimizing testing rounds for fault identification , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[4]  M. Murty.  Ramanujan Graphs , 1965 .

[5]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[6]  Richard Beigel,et al.  Locating faults in a constant number of parallel testing rounds , 1989, SPAA '89.

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

[8]  Gerald M. Masson,et al.  An 0(n2.5) Fault Identification Algorithm for Diagnosable Systems , 1984, IEEE Transactions on Computers.

[9]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[10]  Pavel M. Blecher,et al.  On a logical problem , 1983, Discret. Math..

[11]  Gregory F. Sullivan,et al.  A Polynomial Time Algorithm for Fault Diagnosability , 1984, FOCS.

[12]  S. Louis Hakimi,et al.  On Adaptive System Diagnosis , 1984, IEEE Transactions on Computers.