Can scatter communication take advantage of multidestination message passing?

被引:0
作者
Banikazemi, M [1 ]
Panda, DK [1 ]
机构
[1] Ohio State Univ, Columbus, OH 43210 USA
来源
HIGH PERFORMANCE COMPUTING - HIPC 2000, PROCEEDINGS | 2001年 / 1970卷
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Collective communications compose a significant portion of the communications in many high performance applications. The multidestination message passing mechanism has been proposed recently for efficient implementation of collective operations by using a fewer number of communication phases. However, this mechanism has been only employed for improving the performance of non-personalized collective operations such as multicast. In this paper, we investigate whether multidestination message passing can also help personalized communications such as one-to-all scatter. We propose a new scheme, called Sequential Multidestination Ree-based (SMT) scheme, which takes advantage of the multidestination message passing mechanism and provide a better performance. For a range of system sizes and parameters, it is shown that the SMT scheme outperforms other known schemes for a wide range of message lengths.
引用
收藏
页码:204 / 211
页数:8
相关论文
共 6 条
  • [1] [Anonymous], IEEE COMPUTERS
  • [2] BANIKAZEMI M, 2000, OSUCISRC800TR19 OH S
  • [3] DAI D, 1996, INT C PAR PROC CHIC, P138
  • [4] Simulation of modern parallel systems: A CSIM-based approach
    Panda, DK
    Basak, D
    Dai, D
    Kesavan, R
    Sivaram, R
    Banikazemi, M
    Moorthy, V
    [J]. PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE, 1997, : 1013 - 1020
  • [5] Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed paths
    Panda, DK
    Singal, S
    Kesavan, R
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (01) : 76 - 96
  • [6] PANDA DK, 1995, ICPP WORKSH CHALL PA, P8