Article
Computer Science, Hardware & Architecture
Jun Yuan, Aixia Liu, Xi Wang
Summary: The study introduces a new measurement for fault diagnosis in interconnection networks, called g-extra diagnosability, investigating various networks' g-extra diagnosability under the MM* model and proposing a general approach to derive the g-extra diagnosability from the g-extra connectivity. Additionally, a new relationship between the g-extra connectivity and the g-extra diagnosability of networks is proposed based on existing shared practices.
Article
Mathematics, Applied
Bo Zhu, Shumin Zhang, Huifen Ge, Chengfu Ye
Summary: This paper investigates the reliability of interconnection networks in multiprocessing systems and proposes two new connectivity parameters to accurately measure the network's reliability. Experimental results on hypercube networks are provided.
Article
Computer Science, Hardware & Architecture
Hong Zhang, Jixiang Meng
Summary: This paper investigates the connectivity and conditional diagnosability of DQcube network, providing mathematical formulas for them and analyzing and comparing them under different models.
Article
Mathematics, Applied
Lili Li, Xing Zhang, Qiang Zhu, Yiguang Bai
Summary: Diagnosis and diagnosability of interconnection networks are important research areas. This paper introduces a new measure of diagnosability and determines the 3-extra conditional diagnosability of n-dimensional balanced hypercubes based on their structural properties.
DISCRETE APPLIED MATHEMATICS
(2022)
Article
Computer Science, Theory & Methods
Eddie Cheng, Ke Qiu, Zhizhang Shen
Summary: This paper investigates the fault-tolerance properties of self-diagnosable interconnection networks and proposes an enhanced hypercube structure. It analyzes the g-extra diagnosability of the structure using two diagnostic models.
THEORETICAL COMPUTER SCIENCE
(2022)
Article
Computer Science, Hardware & Architecture
Xinyang Wang, Lijuan Huang, Qiao Sun, Naqin Zhou, Yuehong Chen, Weiwei Lin, Keqin Li
Summary: This paper focuses on the g-extra diagnosability of the balanced hypercube, proving upper and lower bounds using the contradiction method and providing specific formulas under the PMC and MM* models. Simulation experiments were conducted to verify the effectiveness of the proposed theories, contributing certain theoretical and practical value to the research of BHn fault diagnosis.
JOURNAL OF SUPERCOMPUTING
(2022)
Article
Computer Science, Theory & Methods
Huimei Guo, Eminjan Sabir, Aygul Mamut
Summary: This paper explores the g-extra connectivity of n-dimensional folded crossed cubes and provides a calculation formula for some of its properties. The fault diagnosability of FCQ(n) under the PMC model is also analyzed.
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
(2022)
Article
Computer Science, Theory & Methods
Ping Li, Shurong Zhang, Xiaomin Hu, Weihua Yang
Summary: Fault diagnosability is crucial for network reliability. This paper proposes a novel measure called structural diagnosability, which focuses on the diagnosis ability of specific structures rather than individual faulty vertices. The study calculates the structural diagnosability of n-dimensional hypercube under the PMC and MM* models, considering various specific structures.
THEORETICAL COMPUTER SCIENCE
(2023)
Article
Computer Science, Hardware & Architecture
Hong Zhang, Shuming Zhou, Eddie Cheng
Summary: In this work, a novel diagnostic strategy based on cyclic connectivity, namely the cyclic diagnosability, is proposed. The cyclic diagnosability of hypercube Q(n) under the PMC model and the MM* model is investigated, and it is shown that ct(Q(n)) = 5n -10 for n = 7.
Article
Computer Science, Hardware & Architecture
Shanshan Yin, Liqiong Xu
Summary: This paper investigates the g-extra connectivity of the enhanced hypercube Q(n,k) and provides a specific formula for its calculation. Additionally, it extends previous research findings.
Article
Mathematics, Applied
Qianru Zhou, Hai Liu, Baolei Cheng, Yan Wang, Yuejuan Han, Jianxi Fan
Summary: This paper investigates the connectivity and diagnosability of parallel and distributed systems, focusing on the g-good-neighbor condition. A new class of recursive networks called recursive match networks (RMNs) is proposed, which includes BCube and BC networks. The results can be directly applied to BCube and BC networks.
APPLIED MATHEMATICS AND COMPUTATION
(2024)
Article
Computer Science, Theory & Methods
Yalan Li, Jichang Wu, Shumin Zhang, Chengfu Ye
Summary: This paper studies the g-extra connectivity and g-extra conditional diagnosability of round matching composition networks, and obtains some results under the PMC model and MM* model, respectively.
THEORETICAL COMPUTER SCIENCE
(2022)
Article
Multidisciplinary Sciences
Xinyang Wang, Haozhe Li, Qiao Sun, Chen Guo, Hu Zhao, Xinyu Wu, Anqi Wang
Summary: Diagnosability plays a crucial role in evaluating the reliability and fault tolerance of symmetrical multiprocessor systems. The g-good-neighbor conditional diagnosability is suitable for large-scale multiprocessor systems and has received much attention. This paper investigates the relationships between the g-good-neighbor connectivity and diagnosability of graphs under the MM* model, specifically focusing on the exchanged crossed cube (ECO) network structure. The research derives the exact value of the g-good-neighbor diagnosability of ECO under the MM* model and provides a supplement to its diagnosability.
Article
Multidisciplinary Sciences
Qinze Zhu, Yingzhi Tian
Summary: This paper studies the g-extra connectivity of strong product graphs, including the strong product of two paths, the strong product of a path and a cycle, and the strong product of two cycles.
Article
Computer Science, Theory & Methods
Yongcui Tian, Qiang Zhu
Summary: This paper highlights the importance of fault diagnosability evaluation for interconnection networks and introduces various parameters to assess the fault diagnosis capability. The authors also extend previous research by determining the r-component diagnosability of hypercubes under the PMC model and studying its relationship with component connectivity.
THEORETICAL COMPUTER SCIENCE
(2022)