故障诊断度在衡量一个多处理机系统的可靠性上起着极其重要的作用。悲观诊断策略(也称作t/t-诊断策略)在允许最多一个处理机误诊的情况下,能极大地提高多处理机系统的自我诊断度。本文主要证明了在PMC诊断模型下,分层立方网络HCN。是(2n)/(2n)-可诊断的,同时,也给出了时间复杂度比原有的诊断算法较优的t/t-诊断算法。
Fault diagnosability plays an extremely important role on measuring the reliability of a multiprocessor sys- tems. Pessimistic diagnosis strategy, also known as t/t-diagnosis strategy, can greatly improve the multiprocessor sys- tem's self diagnosability even under the condition that it allows a fault-free processor to be misdiagnosed. This paper mainly proves that hierarchical cubic network HCNn is (2n)/(2n) diagnosable under the PMC diagnosis model. At the same time, it also presents an optimal t/t-diagnosis algorithm on time complexity than the original diagnosis algorithm.