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 条
  • [21] A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS
    Khonsari, A.
    Shahrabi, A.
    Ould-Khaoua, M.
    PARALLEL PROCESSING LETTERS, 2007, 17 (02) : 213 - 228
  • [22] A performance model of compressionless routing in k-ary n-cube networks
    Khonsari, A
    Ould-Khaoua, M
    PERFORMANCE EVALUATION, 2006, 63 (4-5) : 423 - 440
  • [23] Unchanging the diameter of k-ary n-cube networks with faulty vertices
    Wang, Shiying
    Li, Jing
    Yang, Yuxing
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2015, 92 (01) : 15 - 28
  • [24] Structure connectivity and substructure connectivity of k-ary n-cube networks
    Lv, Yali
    Fan, Jianxi
    Hsu, D. Frank
    Lin, Cheng-Kuan
    INFORMATION SCIENCES, 2018, 433 : 115 - 124
  • [25] Restricted injection flow control for k-ary n-cube networks
    Izu, C
    Carrion, C
    Gregorio, JA
    Beivide, R
    INTERNATIONAL SOCIETY FOR COMPUTERS AND THEIR APPLICATIONS 10TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 1997, : 511 - 518
  • [26] An optical interconnect model for k-ary n-cube wormhole networks
    Raksapatcharawong, M
    Pinkston, TM
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 666 - 672
  • [27] Processor allocation in k-ary n-cube multiprocessors
    Chuang, PJ
    Wu, CM
    THIRD INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS, PROCEEDINGS (I-SPAN '97), 1997, : 211 - 214
  • [28] Embedding cycles and paths in a k-ary n-cube
    Hsieh, Sun-Yuan
    Lin, Tsong-Jie
    2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 299 - 305
  • [29] Incomplete k-ary n-cube and its derivatives
    Parhami, B
    Kwai, DM
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (02) : 183 - 190
  • [30] Adaptive routing in k-ary n-cube multicomputers
    Yang, CS
    Tsai, YM
    Tsai, YL
    1996 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 1996, : 404 - 411