Gossiping on meshes and tori

被引:13
|
作者
Juurlink, BHH
Sibeyn, JF
Rao, PS
机构
[1] Univ Gesamthsch Paderborn, Heinz Nixdorf Inst, D-33102 Paderborn, Germany
[2] Max Planck Inst Informatik, D-66123 Saarbrucken, Germany
关键词
gossip; global communication; wormhole routing; mesh networks; torus networks;
D O I
10.1109/71.689439
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Algorithms for performing gossiping on one- and higher-dimensional meshes are presented. As a routing model, the practically important wormhole routing is assumed. We especially focus on the trade-off between the start-up time and the transmission time. For one-dimensional arrays and rings, we give a novel lower bound and an asymptotically optimal gossiping algorithm for all choices of the parameters involved. For two-dimensional meshes and tori, a simple algorithm composed of one-dimensional phases is presented. For an important range of packet and mesh sizes, it gives clear improvements upon previously developed algorithms. The algorithm is analyzed theoretically and the achieved improvements are also convincingly demonstrated by simulations, as well as an implementation on the Paragon. On the Paragon, our algorithm even outperforms the gossiping routine provided in the NX message-passing library. For higher-dimensional meshes, we give algorithms which are based on an interesting generalization of the notion of a diagonal. These algorithms are analyzed theoretically, as well as by simulation.
引用
收藏
页码:513 / 525
页数:13
相关论文
共 50 条
  • [21] Complete exchange algorithms for meshes and tori using a systematic approach
    de Cerio, LD
    Valero-García, M
    González, A
    EURO-PAR 2000 PARALLEL PROCESSING, PROCEEDINGS, 2000, 1900 : 591 - 594
  • [22] Upper bounds on the connection probability for 2-D meshes and tori
    Liang, Meilian
    Xu, Xiaodong
    Liang, Jiarong
    Shao, Zehui
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2012, 72 (02) : 185 - 194
  • [23] On Sequential Diagnosability of 2-Dimensional Meshes and Tori (Extended Abstract)
    Hozumi, Shinnosuke
    Yamada, Toshinori
    ISCAS: 2009 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-5, 2009, : 2926 - 2929
  • [24] Embedding of rings in 2-D meshes and tori with faulty nodes
    Kim, JS
    Maeng, SR
    Yoon, H
    JOURNAL OF SYSTEMS ARCHITECTURE, 1997, 43 (09) : 643 - 654
  • [25] Optimal broadcasting and gossiping in one-port meshes of trees with distance-insensitive routing
    Salinger, P
    Tvrdík, P
    PARALLEL COMPUTING, 2002, 28 (04) : 627 - 647
  • [26] A fully adaptive routing algorithm for dynamically injured hypercubes, meshes and tori
    Tsai, MJ
    Wang, SD
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (02) : 163 - 174
  • [27] Embedding Meshes and Tori on Double-Loop Networks of the Same Size
    Chen, Yawen
    Shen, Hong
    IEEE TRANSACTIONS ON COMPUTERS, 2011, 60 (08) : 1157 - 1168
  • [28] Optimal gossiping in square meshes in all-port mode and with short packets (Extended abstract)
    Wang, R
    Lau, FCM
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, PROCEEDINGS, 2005, 3499 : 292 - 306
  • [29] Pipelined all-to-all broadcast in all-port meshes and tori
    Yang, YY
    Wang, JC
    IEEE TRANSACTIONS ON COMPUTERS, 2001, 50 (10) : 1020 - 1032
  • [30] On fault-tolerant embedding of meshes and tori in a flexible hypercube with unbounded expansion
    Lin, Jen-Chih
    WSEAS Transactions on Systems, 2010, 9 (12): : 1143 - 1152