A class of n-unit multiprocessor systems with O(n log n) interconnecting links is constructed, and adistributed probabilistic fault diagnosis algorithm whose probability ofcorrectness converges to 1 as n→∞ is proposed. Forsmall probability of unit failure, a distributed diagnosis whoseprobability also converges to 1 as the size of the system grows isproposed for the hypercube. On the other hand, it is proved that if aclass of systems has fewer than kn log n links for asmall constant k, the probability of correctness of every faultdiagnosis converges to 0 as n→∞. By combining theprobabilistic and the distributed approach the authors' model of faultdiagnosis removes the major drawbacks of the PMC (Preparata-Metze-Chien)model: the assumption of tests with complete fault coverage and theassumption of a fault-free central monitoring unit capable of performingdiagnosis
展开▼
机译:具有 O e1>(
构造 n e1>日志 n e1>)互连链接,并且
概率为
提出 n e1>→∞时,正确性收敛到1。为了
单元故障的可能性很小,是分布式诊断,其
随着系统规模的增长,概率也收敛到1
建议用于超立方体。另一方面,证明了如果
一类系统的 kn e1>日志 n e1>链接少于
小常数 k e1>,每个故障的正确性概率
n e1>→∞,诊断收敛到0。通过结合
概率和分布式方法作者的故障模型
诊断消除了PMC的主要缺点(Preparata-Metze-Chien)
模型:假设测试具有完整的故障覆盖范围,并且
假设能够执行的无故障中央监控单元
诊断
展开▼