摘要
本文讨论双环网构成的分布式系统的可诊断性,并构造一个适用于各种变换结构的诊断算法,文中证明该算法的复杂性为O(n),其中n为网上的节点机数目。
This paper addresses the diagnosability of a distributed system with double- ring structure, and constructs a diagnosis algorithm applicable to all the alttuing structures of the system. It shows that the complexity of the algorithm is O(n), where is the number of computers in the system.
出处
《计算机工程》
CAS
CSCD
北大核心
1992年第4期59-63,共5页
Computer Engineering
关键词
故障诊断
计算机
分布式
System-level diagnosis Test graph Test scheduling Diagnosis algorithm
