The processor failures in a multiprocessor system have a negative impact on its distributed computing efficiency. Because of the rapid expansion of multiprocessor systems, the importance of fault diagnosis is becoming increasingly prominent. The $h$-component diagnosability of $G$, denoted by $ct_{h}(G)$, is the maximum number of nodes of the faulty set $F$ that is correctly identified in a system, and the number of components in $G-F$ is at least $h$. In this paper, we determine the $(h+1)$-component diagnosability of general networks under the PMC model and MM$^{*}$ model. As applications, the component diagnosability is explored for some well-known networks, including complete cubic networks, hierarchical cubic networks, generalized exchanged hypercubes, dual-cube-like networks, hierarchical hypercubes, Cayley graphs generated by transposition trees (except star graphs), and DQcube as well. Furthermore, we provide some comparison results between the component diagnosability and other fault diagnosabilities.

翻译：多处理器系统中的处理器故障对其分布式计算效率产生了负面影响。由于多处理器系统的迅速扩展,断层诊断的重要性越来越突出。美元元组成部分的可诊断性以$ct ⁇ h}(G)美元表示,是系统正确识别的缺陷设置节点最大数量F美元,以$-F美元表示的元件数量至少为1美元。在本文中,我们确定了PMC模型和MM$+1美元模型下一般网络的可构件可诊断性。作为应用,我们探讨了一些众所周知的网络的可诊断性,包括完整的立方网络、等级立方网络、普遍交换的超立方体、双管类网络、等级超立方体、转基因树(恒星图除外)生成的凯利图和DQcube。此外,我们提供了部分可诊断性与其他断层分析性之间的一些比较结果。