Fault-tolerant broadcasting in 2-D wormhole-routed meshes

被引:0
|
作者
Jiang, Z [1 ]
Wu, J [1 ]
机构
[1] Florida Atlantic Univ, Dept Comp Sci & Engn, Boca Raton, FL 33431 USA
关键词
broadcast; communication distance; fault tolerance; meshes; wormhole routing;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a fault-tolerant broadcast scheme in 2-D meshes with randomly generated faults is provided. This approach is based on an early work on time-step optimal broadcasting in square-shape fault-free 2-D meshes with optimal total communication distance (TCD). An extension to any rectangular-shape fault-free 2-D meshes is first given. The fault block model is used in which all faulty nodes in the system are contained in a set of disjoint blocks. The boundary lines of blocks divide the whole mesh into a set of fault-free polygons and a sequence of rectangular fault-free regions is derived from these polygons. Then, the broadcast process is carried out at two levels: inter-region and intra-region. In inter-region-level broadcast, the broadcast message is sent from a given source to a special node (called eye) in each rectangular fault-free region. Then in intra-region-level broadcast, the extended optimal fault-free broadcast is applied. Some analytical results are given which include the upper bound of TCD of such a broadcast in 2-D wormhole-routed meshes.
引用
收藏
页码:2028 / 2034
页数:3
相关论文
共 50 条
  • [41] Link-Disjoint Broadcasting Algorithm in Wormhole-Routed 3D Petersen-Torus Networks
    Seo, Jung-hyun
    Lee, HyeongOk
    INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2013,
  • [42] One-fault tolerance and beyond in wormhole routed meshes
    Lysne, O
    Skeie, T
    Waadeland, T
    MICROPROCESSORS AND MICROSYSTEMS, 1998, 21 (7-8) : 471 - 480
  • [43] Optimal graph algorithms on wormhole routed 2D meshes
    Xu, Yin-Long
    Huang, Liu-Sheng
    Zheng, Qi-Long
    Chen, Guo-Liang
    Jisuanji Xuebao/Chinese Journal of Computers, 2002, 25 (06): : 591 - 598
  • [44] Reliable broadcasting in wormhole-routed hypercube-connected networks using local safety information
    Xiang, D
    Chen, A
    Wu, J
    IEEE TRANSACTIONS ON RELIABILITY, 2003, 52 (02) : 245 - 256
  • [45] A Congestion-Relief Method for Wormhole-routed 2D Mesh Networks
    Wang, Wen-Fong
    Shen, Yi-Jhou
    THIRD INTERNATIONAL CONFERENCE ON INFORMATION SECURITY AND INTELLIGENT CONTROL (ISIC 2012), 2012, : 75 - 78
  • [46] An Euler-path-based multicasting model for wormhole-routed networks: Its applications to damaged 2D tori and meshes
    Juang, TY
    Tseng, YC
    Yang, MH
    1977 IEEE INTERNATIONAL PERFORMANCE, COMPUTING AND COMMUNICATIONS CONFERENCE, 1997, : 444 - 450
  • [47] Latency reduction of global traffic in wormhole-routed meshes using hierarchical rings for global routing
    Bourduas, S.
    Zilic, Z.
    2007 IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, 2007, : 302 - 307
  • [48] Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
    Wu, J
    Wang, DJ
    2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 247 - 254
  • [49] Fault-tolerant adaptive and shortest routing in 2-D extended meshes using faulty-block-information
    Chen, X
    2000 INTERNATIONAL WORKSHOPS ON PARALLEL PROCESSING, PROCEEDINGS, 2000, : 267 - 274
  • [50] Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
    Wu, Jie
    Wang, Dajin
    INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2005, 20 (02) : 99 - 111