View in EDS

Characterization of cyclic local diagnosability of interconnection networks.

Saved in:
Bibliographic Details
Title: Characterization of cyclic local diagnosability of interconnection networks.
Authors: Zheng, Weixing1 (AUTHOR), Zhou, Shuming2 (AUTHOR), Cheng, Eddie3 (AUTHOR), Yang, Lulu1 (AUTHOR)
Source: Computer Journal. Jun2026, Vol. 69 Issue 6, p1039-1049. 11p.
Subjects: Fault diagnosis, Multiprocessors, Computer network architectures
Abstract: With the growing scale and complexity of high-performance computing systems, ensuring reliability through robust fault diagnosis becomes increasingly critical. System-level diagnosis plays a key role in identifying faulty processors and maintaining system stability of multiprocessor systems. However, traditional diagnosability, as a global reliability metric for multiprocessor systems, overlooks local diagnostic capability, topological criticality, and fault distribution. In order to better capture the local characteristics of a system around a given node, this work proposes a novel fault diagnosis strategy, called cyclic local diagnosability, where the cyclic fault pattern requires that at least two components contain cycles. We propose some characterizations of cyclic local diagnosability of interconnection networks under PMC and MM* models. As applications, we determine the cyclic local diagnosabilities of data center network DCell (⁠|$D_{k,n}$|⁠), |$(n,k)$| -star graph (⁠|$S_{n,k}$|⁠) and |$(n,k)$| -bubble-sort graph (⁠|$B_{n,k}$|⁠) under PMC and MM* models. Finally, we show the superiority of the cyclic local diagnosability through comparison with other conditional diagnosabilities. [ABSTRACT FROM AUTHOR]
Copyright of Computer Journal is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:With the growing scale and complexity of high-performance computing systems, ensuring reliability through robust fault diagnosis becomes increasingly critical. System-level diagnosis plays a key role in identifying faulty processors and maintaining system stability of multiprocessor systems. However, traditional diagnosability, as a global reliability metric for multiprocessor systems, overlooks local diagnostic capability, topological criticality, and fault distribution. In order to better capture the local characteristics of a system around a given node, this work proposes a novel fault diagnosis strategy, called cyclic local diagnosability, where the cyclic fault pattern requires that at least two components contain cycles. We propose some characterizations of cyclic local diagnosability of interconnection networks under PMC and MM* models. As applications, we determine the cyclic local diagnosabilities of data center network DCell (⁠|$D_{k,n}$|⁠), |$(n,k)$| -star graph (⁠|$S_{n,k}$|⁠) and |$(n,k)$| -bubble-sort graph (⁠|$B_{n,k}$|⁠) under PMC and MM* models. Finally, we show the superiority of the cyclic local diagnosability through comparison with other conditional diagnosabilities. [ABSTRACT FROM AUTHOR]
ISSN:00104620
DOI:10.1093/comjnl/bxag009