Correct and Almost Complete Diagnosis of Processor Grids

A new diagnosis algorithm for square grids is introduced. The algorithm always provides correct diagnosis if the number of faulty processors is below T, a bound with T /spl epsi//spl Theta/(n/sup 2/3/), which was derived by worst-case analysis. A more effective tool to validate the diagnosis correctness is the syndrome dependent bound T/sub /spl sigma// with T/sub /spl sigma///spl ges/T, asserted by the diagnosis algorithm itself for every given diagnosis experiment. Simulation studies provided evidence that the diagnosis is complete or almost complete if the number of faults is below T. The fraction of units which cannot be identified as either faulty or nonfaulty remains relatively small as long as the number of faults is below n/3 and, as long as the number of faults is below n/2, the diagnosis is correct with high probability.

[1]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

[2]  Edward R. Scheinerman.  Almost Sure Fault Tolerance in Random Graphs , 1987, SIAM J. Comput..

[3]  Douglas M. Blough,et al.  Efficient Diagnosis of Multiprocessor Systems under Probabilistic Models , 1992, IEEE Trans. Computers.

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

[5]  Sampath Rangarajan,et al.  Diagnosing Arbitrarily Connected Parallel Computers with High Probability , 1992, IEEE Trans. Computers.

[6]  Frank Harary,et al.  Graph Theory , 2016 .

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

[8]  Sampath Rangarajan,et al.  Probabilistic diagnosis of multiprocessor systems with arbitrary connectivity , 1989, [1989] The Nineteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[9]  L. Baldelli,et al.  Diagnosis of processor arrays , 1994, Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing.

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

[11]  Paolo Santi,et al.  Self diagnosis of processor arrays using a comparison model , 1995, Proceedings. 14th Symposium on Reliable Distributed Systems.

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

[13]  Vinod K. Agarwal,et al.  A Diagnosis Algorithm for Constant Degree Structures and Its Application to VLSI Circuit Testing , 1995, IEEE Trans. Parallel Distributed Syst..

[14]  Kaiyuan Huang,et al.  Almost sure diagnosis of almost every good element , 1991, [Proceedings] 1991 International Workshop on Defect and Fault Tolerance on VLSI Systems.

[15]  BarborakMichael,et al.  The consensus problem in fault-tolerant computing , 1993 .

[16]  Vinod K. Agarwal,et al.  Distributed Diagnosis Algorithms for Regular Interconnected Structures , 1992, IEEE Trans. Computers.

[17]  Sampath Rangarajan,et al.  Built-In Testing of Integrated Circuit Wafers , 1990, IEEE Trans. Computers.

[18]  Sampath Rangarajan,et al.  A probabilistic method for fault diagnosis of multiprocessor systems , 1988, [1988] The Eighteenth International Symposium on Fault-Tolerant Computing. Digest of Papers.

[19]  Vinod K. Agarwal,et al.  Almost Sure Diagnosis of Almost Every Good Element , 1994, IEEE Trans. Computers.