Deadlock-free fault-tolerant multicast routing in hypercubes

被引：0
|
作者：
Sengupta, A. [1 ]
Viswanathan, S. [1 ]
机构：
[1] Department of Computer Science, University of South Carolina, Columbia, SC 29208, United States
来源：
Parallel Processing Letters | 2000年 / 10卷 / 04期
关键词：
Computer simulation - Computer system recovery - Data structures - Fault tolerant computer systems - Multicasting - Parallel algorithms - Parallel processing systems;
D O I：
10.1142/s0129626400000317
中图分类号：
学科分类号：
摘要：
In this paper, an algorithm is presented to embedd a ring in an n-dimensional hypercube with at most n - 1 faults; subsequently, the embedded ring is used for efficient deadlock-free multicast routing between all the fault-free nodes. Simulation results are presented to compare the performance of the algorithm to that of the routing algorithm proposed in [9] for a fault-free hypercube to study the performance degradation because of faults. A modification to the algorithm of [9] is also presented for improved performance.
引用
下载
收藏
页码：327 / 342
相关论文
共 50 条
  • [41] Deadlock-free routing using distributed Hamilton path labeling in wormhole routed hypercubes
    Wang, SC
    Chen, IY
    Kuo, SY
    PROCEEDINGS OF THE 3RD AUSTRALASIAN COMPUTER ARCHITECTURE CONFERENCE, ACAC'98, 1998, 20 (04): : 205 - 214
  • [42] DEADLOCK-FREE MULTICAST WORMHOLE ROUTING IN 2-D MESH MULTICOMPUTERS
    LIN, XO
    MCKINLEY, PK
    NI, LM
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (08) : 793 - 804
  • [43] FAULT-TOLERANT MULTICASTING ON HYPERCUBES
    LIANG, AC
    BHATTACHARYA, S
    TSAI, WT
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1994, 23 (03) : 418 - 428
  • [44] Transitively Deadlock-Free Routing Algorithms
    Quintin, Jean-Noel
    Vigneras, Pierre
    2016 2ND IEEE INTERNATIONAL WORKSHOP ON HIGH-PERFORMANCE INTERCONNECTION NETWORKS IN THE EXASCALE AND BIG-DATA ERA (HIPINEB), 2016, : 16 - 24
  • [45] German methodologies for deadlock-free routing
    Park, H
    Agrawal, DP
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 638 - 643
  • [46] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    INTERNATIONAL JOURNAL OF TEACHER EDUCATION AND PROFESSIONAL DEVELOPMENT, 2020, 3 (01) : 1 - +
  • [47] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    INTERNATIONAL JOURNAL OF EMBEDDED AND REAL-TIME COMMUNICATION SYSTEMS (IJERTCS), 2022, 13 (01):
  • [48] Fault-Tolerant Routing Based on Approximate Directed Routable Probabilities for Hypercubes
    Thuy Dinh Duong
    Kaneko, Keiichi
    ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT I: ICA3PP 2011, 2011, 7916 : 106 - 116
  • [49] Deadlock-free interval routing schemes
    Flammini, M
    STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 351 - 362
  • [50] Deadlock-free interval routing schemes
    Flammini, M
    NETWORKS, 1999, 34 (01) : 47 - 60
12345