Faster topology-aware collective algorithms through non-minimal communication

Author:

Sack Paul1,Gropp William1

Affiliation:

1. University of Illinois at Urbana-Champaign, Urbana, IL, USA

Abstract

Known algorithms for two important collective communication operations, allgather and reduce-scatter, are minimal-communication algorithms; no process sends or receives more than the minimum amount of data. This, combined with the data-ordering semantics of the operations, limits the flexibility and performance of these algorithms. Our novel non-minimal, topology-aware algorithms deliver far better performance with the addition of a very small amount of redundant communication. We develop novel algorithms for Clos networks and single or multi-ported torus networks. Tests on a 32k-node BlueGene/P result in allgather speedups of up to 6x and reduce-scatter speedups of over 11x compared to the native IBM algorithm. Broadcast, reduce, and allreduce can be composed of allgather or reduce-scatter and other collective operations; our techniques also improve the performance of these algorithms.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Graphics and Computer-Aided Design,Software

Reference19 articles.

1. HyperX

2. Interprocessor collective communication library (InterCom)

3. K. Bergman S. Borkar D. Campbell W. Carlson W. Dally M. Denneau P. Franzon W. Harrod J. Hiller S. Karp S. Keckler D. Klein R. Lucas M. Richards A. Scarpelli S. Scott A. Snavely T. Sterling R. S. Williams and K. Yelick. Exascale computing study: Technology challenges in achieving exascale systems 2008. K. Bergman S. Borkar D. Campbell W. Carlson W. Dally M. Denneau P. Franzon W. Harrod J. Hiller S. Karp S. Keckler D. Klein R. Lucas M. Richards A. Scarpelli S. Scott A. Snavely T. Sterling R. S. Williams and K. Yelick. Exascale computing study: Technology challenges in achieving exascale systems 2008.

4. Efficient algorithms for all-to-all communications in multiport message-passing systems

Cited by 23 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Efficient Algorithm for All-Gather Operation in Optical Interconnect Systems;IEEE Open Journal of the Communications Society;2024

2. Generalized Collective Algorithms for the Exascale Era;2023 IEEE International Conference on Cluster Computing (CLUSTER);2023-10-31

3. Wrht: Efficient All-reduce for Distributed DNN Training in Optical Interconnect Systems;Proceedings of the 52nd International Conference on Parallel Processing;2023-08-07

4. A framework for hierarchical single-copy MPI collectives on multicore nodes;2022 IEEE International Conference on Cluster Computing (CLUSTER);2022-09

5. Optimizing Non-commutative Allreduce Over Virtualized, Migratable MPI Ranks;2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW);2022-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3