In a multiprocessor system, as a key measure index for evaluating its reliability, diagnosability has attracted lots of attentions. Traditional diagnosability and conditional diagnosability have already been widely discussed. However, the existing diagnosability measures are not sufficiently comprehensive to address a large number of faulty nodes in a system. This article introduces a novel concept of diagnosability, called two-round diagnosability, which means that all faulty nodes can be identified by at most a one-round replacement (repairing the faulty nodes). The characterization of two-round -diagnosable systems is provided; moreover, several important properties are also presented. Based on the abovementioned theories, for the -dimensional hypercube , we show that its two-round diagnosability is , which is times its classic diagnosability. Furthermore, a fault diagnosis algorithm is proposed to identify each node in the system under the PMC model. For , we prove that the proposed algorithm is the time complexity of .

中文翻译：

---

多处理器系统的两轮可诊断性度量

在多处理器系统中，作为评估其可靠性的关键指标，可诊断性引起了很多关注。传统的可诊断性和条件可诊断性已被广泛讨论。但是，现有的可诊断性措施不足以解决系统中的大量故障节点。本文介绍了一种新颖的可诊断性概念，称为两轮可诊断性，这意味着最多可以通过单轮替换（修复故障节点）来识别所有故障节点。两回合的特性-可诊断系统是提供的; 此外，还介绍了几个重要的属性。基于上述理论，对-维超立方体， 我们证明它的两轮可诊断性是 ，这是倍其经典的可诊断性。此外，提出了一种故障诊断算法来识别PMC模型下系统中的每个节点。为此，我们证明了所提出的算法是的时间复杂度。