Fault-tolerant communication algorithms in toroidal networks

被引：15
|
作者：
AlMohammad, BFA
Bose, B
机构：
[1] Kuwait Univ, Dept Math & Comp Sci, Safat 13060, Kuwait
[2] Oregon State Univ, Dept Comp Sci, Corvallis, OR 97331 USA
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1999年 / 10卷 / 10期
基金：
美国国家科学基金会;
关键词：
interconnection networks; torus; kappa-ary n-cubes; fault-free communication algorithms; fault-tolerant communication algorithms;
D O I：
10.1109/71.808130
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Fault-tolerant communication algorithms for k-ary n-cubes are introduced. These include. One-to-all broadcasting, all-to-all broadcasting, one-to-all personalized communication, and all-to-all personalized communication. Each of these algorithms can tolerate up to (2n - 2) node failures provided that k > (2n - 2) and k > 3. Extensions of these algorithms with up to 2n - 1 node failures are also described. The communication complexities of the proposed algorithms are derived when wormhole or store and forward packet routing is used.
引用
收藏
页码：976 / 983
页数：8
相关论文
共 50 条
  • [1] Fault-tolerant communication algorithms in toroidal networks
    Almohammad, B
    Bose, B
    [J]. TWENTY-EIGHTH ANNUAL INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, DIGEST PAPERS, 1998, : 186 - 194
  • [2] Fault-tolerant broadcasting in toroidal networks
    Almohammad, B
    Bose, B
    [J]. PARALLEL AND DISTRIBUTED PROCESSING, 1998, 1388 : 681 - 692
  • [3] Robust and Fault-Tolerant Communication Networks
    Tavernier, Wouter
    Frincke, Deborah
    Autenrieth, Achim
    Colle, Didier
    [J]. COMPUTER NETWORKS, 2015, 82 : 1 - 3
  • [4] Fault-tolerant routing algorithms for unidirectional networks
    Lam, CW
    Lau, FCM
    [J]. I-SPAN'02: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND NETWORKS, PROCEEDINGS, 2002, : 329 - 333
  • [5] Fault-tolerant routing algorithms for hypercube networks
    Kaneko, K
    Ito, H
    [J]. IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, : 218 - 224
  • [6] Efficient algorithms for fault-tolerant communication in optical WDM networks (short version)
    Shen, H
    Li, KQ
    Pan, Y
    Zheng, SQ
    [J]. FOURTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS, AND NETWORKS (I-SPAN'99), PROCEEDINGS, 1999, : 119 - 124
  • [7] Fault-tolerant broadcasting and gossiping in communication networks
    Pelc, A
    [J]. NETWORKS, 1996, 28 (03) : 143 - 156
  • [8] Fault-tolerant Communication in Invasive Networks on Chip
    Heisswolf, Jan
    Weichslgartner, Andreas
    Zaib, Aurang
    Friederich, Stephanie
    Masing, Leonard
    Stein, Carsten
    Duden, Marco
    Kloepfer, Roman
    Teich, Juergen
    Wild, Thomas
    Herkersdorf, Andreas
    Becker, Juergen
    [J]. 2015 NASA/ESA CONFERENCE ON ADAPTIVE HARDWARE AND SYSTEMS (AHS), 2015,
  • [9] FAULT-TOLERANT WORMHOLE ROUTING ALGORITHMS FOR MESH NETWORKS
    BOPPANA, RV
    CHALASANI, S
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (07) : 848 - 864
  • [10] Fault-tolerant routing algorithms for hypercube interconnection networks
    Kaneko, K
    Ito, H
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2001, E84D (01): : 121 - 128
12345