### Abstract

A class of n-unit multiprocessor systems with O(n log n) interconnecting links is constructed, and a distributed probabilistic fault diagnosis algorithm whose probability of correctness converges to 1 as n → ∞ is proposed. For small probability of unit failure, a distributed diagnosis whose probability also converges to 1 as the size of the system grows is proposed for the hypercube. On the other hand, it is proved that if a class of systems has fewer than kn log n links for a small constant k, the probability of correctness of every fault diagnosis converges to 0 as n → ∞. By combining the probabilistic and the distributed approach the authors' model of fault diagnosis removes the major drawbacks of the PMC (Preparata-Metze-Chien) model: the assumption of tests with complete fault coverage and the assumption of a fault-free central monitoring unit capable of performing diagnosis.

Original language | English (US) |
---|---|

Title of host publication | Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) |

Publisher | Publ by IEEE |

Pages | 340-346 |

Number of pages | 7 |

ISBN (Print) | 081862051X |

State | Published - Dec 1 1990 |

Event | 20th International Symposium on Fault-Tolerant Computing - FTCS 20 - Chapel Hill, NC, USA Duration: Jun 26 1990 → Jun 28 1990 |

### Publication series

Name | Digest of Papers - FTCS (Fault-Tolerant Computing Symposium) |
---|---|

ISSN (Print) | 0731-3071 |

### Other

Other | 20th International Symposium on Fault-Tolerant Computing - FTCS 20 |
---|---|

City | Chapel Hill, NC, USA |

Period | 6/26/90 → 6/28/90 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Hardware and Architecture

### Cite this

*Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)*(pp. 340-346). (Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)). Publ by IEEE.

}

*Digest of Papers - FTCS (Fault-Tolerant Computing Symposium).*Digest of Papers - FTCS (Fault-Tolerant Computing Symposium), Publ by IEEE, pp. 340-346, 20th International Symposium on Fault-Tolerant Computing - FTCS 20, Chapel Hill, NC, USA, 6/26/90.

**Distributed probabilistic fault diagnosis for multiprocessor systems.** / Berman, Piotr; Pelc, Andrzej.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Distributed probabilistic fault diagnosis for multiprocessor systems

AU - Berman, Piotr

AU - Pelc, Andrzej

PY - 1990/12/1

Y1 - 1990/12/1

N2 - A class of n-unit multiprocessor systems with O(n log n) interconnecting links is constructed, and a distributed probabilistic fault diagnosis algorithm whose probability of correctness converges to 1 as n → ∞ is proposed. For small probability of unit failure, a distributed diagnosis whose probability also converges to 1 as the size of the system grows is proposed for the hypercube. On the other hand, it is proved that if a class of systems has fewer than kn log n links for a small constant k, the probability of correctness of every fault diagnosis converges to 0 as n → ∞. By combining the probabilistic and the distributed approach the authors' model of fault diagnosis removes the major drawbacks of the PMC (Preparata-Metze-Chien) model: the assumption of tests with complete fault coverage and the assumption of a fault-free central monitoring unit capable of performing diagnosis.

AB - A class of n-unit multiprocessor systems with O(n log n) interconnecting links is constructed, and a distributed probabilistic fault diagnosis algorithm whose probability of correctness converges to 1 as n → ∞ is proposed. For small probability of unit failure, a distributed diagnosis whose probability also converges to 1 as the size of the system grows is proposed for the hypercube. On the other hand, it is proved that if a class of systems has fewer than kn log n links for a small constant k, the probability of correctness of every fault diagnosis converges to 0 as n → ∞. By combining the probabilistic and the distributed approach the authors' model of fault diagnosis removes the major drawbacks of the PMC (Preparata-Metze-Chien) model: the assumption of tests with complete fault coverage and the assumption of a fault-free central monitoring unit capable of performing diagnosis.

UR - http://www.scopus.com/inward/record.url?scp=0025665993&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025665993&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0025665993

SN - 081862051X

T3 - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)

SP - 340

EP - 346

BT - Digest of Papers - FTCS (Fault-Tolerant Computing Symposium)

PB - Publ by IEEE

ER -