The properties and t/s-diagnosability of k-ary n-cube networks

被引:7
|
作者
Xie, Yuhao [1 ,2 ]
Liang, Jiarong [1 ,2 ]
Yin, Wen [1 ,2 ]
Li, Changzhen [3 ]
机构
[1] Guangxi Univ, Sch Comp Elect & Informat, Nanning 530004, Guangxi, Peoples R China
[2] Guangxi Univ, Guangxi Key Lab Multimedia Commun & Network Techn, Nanning 530004, Guangxi, Peoples R China
[3] Guangxi Univ, Sch Publ Policy & Management, Nanning 530004, Guangxi, Peoples R China
来源
JOURNAL OF SUPERCOMPUTING | 2022年 / 78卷 / 05期
基金
中国国家自然科学基金;
关键词
Fault node identification; t/s-diagnosis strategy; Diagnosis model; PMC model; k-ary n-cubes; CONDITIONAL DIAGNOSABILITY; STRUCTURAL-PROPERTIES; STAR GRAPHS; DIAGNOSIS; PMC; HYPERCUBES; ALGORITHM;
D O I
10.1007/s11227-021-04155-y
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
An increase in network system size increases the risk of node failure in a system. To maintain the reliability of the system, the faulty nodes need to be repaired or replaced with additional nodes, which implies that the approach of locating the faulty nodes in the system is a research topic of great significance. There are various kinds of diagnosis strategies, such as the t-diagnosis strategy, t/s-diagnosis strategy, t/t-diagnosis strategy and t/k-diagnosis strategy. When we use the t/s-diagnosis strategy to identify faulty nodes, some fault-free nodes may be identified as faulty nodes. In addition, the choice of the specific diagnosis model to identify faulty nodes is important; the Preparata, Metze and Chen (PMC) model is widely used. In this paper, we study the t/s-diagnosability of the k-ary n-cube under the PMC model. First, we obtain several structural properties of k-ary n-cubes. Then, we use these properties and determine that the 3-ary n-cube is eta/eta + h - 1-diagnosable, where n >= 2, 1 <= h n - 1 and 2hn - 3(h - 1) - (h-1)(h-2)/2 -1 < eta <= 2(h + 1)n - 3h - h(h-1)/2 -1, and that the k-ary n-cube is eta/eta + h- 1-diagnosable, where k >= 4, n >= 2, 1 <= h n - 1 and 2hn - 2(h - 1) - (h-1)(h-2)/2 -1 < eta <= 2(h +1)n - 2h - h(h-1)/2 -1.
引用
收藏
页码:7038 / 7057
页数:20
相关论文
共 50 条
  • [31] The conditional node connectivity of the k-ary n-cube
    Day, K
    Harous, S
    Al-Ayyoub, AE
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOL VI, PROCEEDINGS, 1999, : 2706 - 2710
  • [32] EXPRESS CUBES - IMPROVING THE PERFORMANCE OF K-ARY N-CUBE INTERCONNECTION NETWORKS
    DALLY, WJ
    IEEE TRANSACTIONS ON COMPUTERS, 1991, 40 (09) : 1016 - 1023
  • [33] Performance analysis of k-ary n-cube networks with pipelined circuit switching
    Min, GY
    Sarbazi-Azad, H
    Ould-Khaoua, M
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 2000, 11 (02): : 111 - 127
  • [34] Parallel solution of dense linear systems on the k-ary n-cube networks
    Al-Ayyoub, AE
    Day, K
    INTERNATIONAL JOURNAL OF HIGH SPEED COMPUTING, 1997, 9 (02): : 85 - 99
  • [35] THE INDIRECT K-ARY N-CUBE FOR A VECTOR PROCESSING ENVIRONMENT
    BROOKS, ED
    PARALLEL COMPUTING, 1988, 6 (03) : 339 - 348
  • [36] The 3-path-connectivity of the k-ary n-cube
    Zhu, Wen -Han
    Hao, Rong-Xia
    Feng, Yan-Quan
    Lee, Jaeun
    APPLIED MATHEMATICS AND COMPUTATION, 2023, 436
  • [37] The k-ary n-cube network:: modeling, topological properties and routing strategies
    Ghozati, SA
    Wasserman, HC
    COMPUTERS & ELECTRICAL ENGINEERING, 1999, 25 (03) : 155 - 168
  • [38] k-ary n-cube network: Modeling, topological properties and routing strategies
    Department of Computer Science, Queens College of the CUNY, Flushing, NY 11367, United States
    Comput Electr Eng, 3 (155-168):
  • [39] INS - Interconnection network simulator for k-ary n-cube
    Xiao, X.-Q.
    Jin, S.-Y.
    Jiang, Y.-Q.
    Cao, L.-Q.
    Xitong Fangzhen Xuebao/Acta Simulata Systematica Sinica, 2001, 13 (02): : 206 - 209
  • [40] The Reliability of k-Ary n-Cube Based on Component Connectivity
    Lv, Mengjie
    Fan, Jianxi
    Zhou, Jingya
    Yu, Jia
    Jia, Xiaohua
    COMPUTER JOURNAL, 2022, 65 (08): : 2197 - 2208