A fault-tolerant tree communication scheme for hypercube systems

被引：6
|
作者：
Leu, YR
Kuo, SY
机构：
[1] Department of Electrical Engineering, National Taiwan University, Taipei
来源：
IEEE TRANSACTIONS ON COMPUTERS | 1996年 / 45卷 / 06期
关键词：
hypercube; failures; tree communication; uniform data distribution; fault-tolerance;
D O I：
10.1109/12.506421
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The tree communication scheme was shown to be very efficient for global operations on data residing in the processors of a hypercube with time complexity of O(log(2)N), where N is the number of processors. This communication scheme is very useful for many parallel algorithms on hypercube multiprocessors. If a problem can be divided into independent subproblems, each subproblem can first be solved by one of the processors. Then, the tree communication scheme is invoked to merge the subresults into the final results. All the algorithms for problems with this property can benefit from the tree communication scheme. We propose a more general and efficient tree communication scheme in this paper. In addition, we also propose fault-tolerant algorithms for the tree communication scheme, by exploiting the unique properties of the tree communication scheme. The computation and communication slowdown is small (< 2) under the effect of multiple link and/or node failures.
引用
收藏
页码：641 / 650
页数：10
相关论文
共 50 条
  • [21] A fault-tolerant routing strategy in hypercube multicomputers
    Chiu, GM
    Wu, SP
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1996, 45 (02) : 143 - 155
  • [22] 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
  • [23] FAULT-TOLERANT MATRIX OPERATIONS ON HYPERCUBE MULTIPROCESSORS
    ELSTER, AC
    UYAR, MU
    REEVES, AP
    [J]. PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 3: ALGORITHMS AND APPLICATIONS, 1989, : 169 - 176
  • [24] FAULT TREE MODELS FOR FAULT TOLERANT HYPERCUBE MULTIPROCESSORS
    BOYD, MA
    TUAZON, JO
    [J]. PROCEEDINGS ANNUAL RELIABILITY AND MAINTAINABILITY SYMPOSIUM, 1991, (SYM): : 610 - 614
  • [25] Fault-tolerant wormhole routing for hypercube networks
    Shih, JD
    [J]. INFORMATION PROCESSING LETTERS, 2003, 86 (02) : 93 - 100
  • [26] Fault-tolerant message routing in the extended hypercube
    Kumar, MJ
    Patnaik, LM
    Nag, B
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 1998, 44 (9-10) : 691 - 702
  • [27] FAULT-TOLERANT SORTING ALGORITHM ON HYPERCUBE MULTICOMPUTERS
    SHEU, JP
    CHEN, YS
    CHANG, CY
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1992, 16 (02) : 185 - 197
  • [28] AN ADAPTIVE DEPENDABLE FAULT-TOLERANT SCHEME FOR DISTRIBUTED SYSTEMS
    Liu, Guoliang
    Chen, Shuyu
    [J]. THIRD INTERNATIONAL CONFERENCE ON COMPUTER ENGINEERING AND TECHNOLOGY (ICCET 2011), 2011, : 697 - 702
  • [29] An Adaptive Fault-Tolerant Communication Scheme for Body Sensor Networks
    Wu, Guowei
    Ren, Jiankang
    Xia, Feng
    Xu, Zichuan
    [J]. SENSORS, 2010, 10 (11) : 9590 - 9608
  • [30] An Extended Generalized Hypercube as a Fault-Tolerant System Area Network for Multiprocessor Systems
    Karavay, M. F.
    Podlazov, V. S.
    [J]. AUTOMATION AND REMOTE CONTROL, 2015, 76 (02) : 336 - 352
12345