The diagnosability of k-ary n-cubes with missing edges

被引：2
|
作者：
Fan, Liqiang [1 ]
Yuan, Jun [1 ]
机构：
[1] Taiyuan Univ Sci & Technol, Sch Appl Sci, Taiyuan 030024, Shanxi, Peoples R China
来源：
INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS | 2020年 / 35卷 / 01期
基金：
中国国家自然科学基金;
关键词：
Interconnection networks; diagnosability; fault tolerance; k-ary n-cubes; CONDITIONAL DIAGNOSABILITY;
D O I：
10.1080/17445760.2019.1655741
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The k-ary n-cube is a popular interconnection network for many multiprocessor systems because of its good topological structure. In this paper, we investigated the relationship between the fault diagnosability of k-ary n-cube with missing edges and its minimum degree of vertices. Let G be a k-ary n-cube with missing edges and the minimum degree delta(G) = r. Then we show that the diagnosability of G is r for r >= 3, n >= 2 under the PMC model and BGM model. [GRAPHICS] .
引用
收藏
页码：57 / 68
页数：12
相关论文
共 50 条
  • [21] On k-ary n-cubes and isometric words
    Anselmo, Marcella
    Flores, Manuela
    Madonia, Maria
    THEORETICAL COMPUTER SCIENCE, 2022, 938 : 50 - 64
  • [22] Fault-Free Hamiltonian Cycles Passing through Prescribed Edges in k-Ary n-Cubes with Faulty Edges
    Zhang, Shurong
    Zhang, Xianwen
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2015, 26 (02) : 434 - 443
  • [23] Embedding Hamiltonian Paths in k-Ary n-Cubes With Exponentially-Many Faulty Edges
    Zhuang, Hongbin
    Li, Xiao-Yan
    Chang, Jou-Ming
    Lin, Cheng-Kuan
    Liu, Ximeng
    IEEE TRANSACTIONS ON COMPUTERS, 2023, 72 (11) : 3245 - 3258
  • [24] Upper bounds on the queuenumber of k-ary n-cubes
    Pai, Kung-Jui
    Chang, Jou-Ming
    Wang, Yue-Li
    INFORMATION PROCESSING LETTERS, 2009, 110 (02) : 50 - 56
  • [25] Adaptive wormhole routing in k-ary n-cubes
    Yang, CS
    Tsai, YM
    Chi, SL
    Shi, SSB
    PARALLEL COMPUTING, 1995, 21 (12) : 1925 - 1943
  • [26] Embedding long paths in k-ary n-cubes with faulty nodes and links
    Stewart, Iain A.
    Xiang, Yonghong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2008, 19 (08) : 1071 - 1085
  • [27] Embedding various cycles with prescribed paths into k-ary n-cubes
    Yang, Yuxing
    Li, Jing
    Wang, Shiying
    DISCRETE APPLIED MATHEMATICS, 2017, 220 : 161 - 169
  • [28] Routing in bidirectional k-ary n-cubes with the Red Rover algorithm
    Draper, J
    Petrini, F
    INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-III, PROCEEDINGS, 1997, : 1184 - 1193
  • [29] Strong Menger Connectedness of Augmented k-ary n-cubes
    Gu, Mei-Mei
    Chang, Jou-Ming
    Hao, Rong-Xia
    COMPUTER JOURNAL, 2021, 64 (05) : 812 - 825
  • [30] Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
    Wang, Shiying
    Li, Jing
    Lin, Shangwei
    Wang, Ruixia
    INFORMATION AND COMPUTATION, 2013, 230 : 55 - 66
12345