poster

Collective algorithms for sub-communicators

Authors:

Sameer KumarAuthors Info & Claims

ACM SIGPLAN Notices, Volume 47, Issue 8

Pages 315 - 316

https://doi.org/10.1145/2370036.2145872

Published: 25 February 2012 Publication History

Get Access

Abstract

Collective communication over a group of processors is an integral and time consuming component in many HPC applications. Many modern day supercomputers are based on torus interconnects. On such systems, for an irregular communicator comprising of a subset of processors, the algorithms developed so far are not contention free in general and hence non-optimal.

In this paper, we present a novel contention-free algorithm to perform collective operations over a subset of processors in a torus network. We also extend previous work on regular communicators to handle special cases of irregular communicators that occur frequently in parallel scientific applications. For the generic case where multiple node disjoint sub-communicators communicate simultaneously in a loosely synchronous fashion, we propose a novel cooperative approach to route the data for individual sub-communicators without contention. Empirical results demonstrate that our algorithms outperform the optimized MPI collective implementation on IBM's Blue Gene/P supercomputer for large data sizes and random node distributions.

References

[1]

A. Faraj, S. Kumar, B. Smith, A. Mamidala, J. Gunnels, and P. Heidelberger. MPI collective communications on the Blue Gene/P supercomputer: algorithms and optimizations". In ICS, pages 489--490, 2009.

Digital Library

Google Scholar

[2]

N. Jain and Y. Sabharwal. Optimal bucket algorithms for large MPI collectives on torus interconnects. In ICS, pages 27--36, 2010.

Digital Library

Google Scholar

[3]

M. Shroff and R. A. V. D. Geijn. Collmark: Mpi collective communication benchmark. Technical report, 2000.

Google Scholar

Cited By

View all

Guo JYi QMeng JZhang JBalaji P(2016)Compiler-Assisted Overlapping of Communication and Computation in MPI Applications2016 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER.2016.62(60-69)Online publication date: Sep-2016
https://doi.org/10.1109/CLUSTER.2016.62
Zahavi EKeslassy IKolodny A(2014)Quasi Fat Trees for HPC Clouds and Their Fault-Resilient Closed-Form RoutingProceedings of the 2014 IEEE 22nd Annual Symposium on High-Performance Interconnects10.1109/HOTI.2014.19(41-48)Online publication date: 26-Aug-2014
https://dl.acm.org/doi/10.1109/HOTI.2014.19

Index Terms

Collective algorithms for sub-communicators
1. Software and its engineering

Recommendations

Collective algorithms for sub-communicators
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

Collective communication over a group of processors is an integral and time consuming component in many HPC applications. Many modern day supercomputers are based on torus interconnects. On such systems, for an irregular communicator comprising of a ...
Collective algorithms for sub-communicators
ICS '12: Proceedings of the 26th ACM international conference on Supercomputing

Collective communication over a group of processors is an integral and time consuming component in many high performance computing applications. Many modern day super- computers are based on torus interconnects and near optimal algorithms have been ...
Towards an Accurate Model for Collective Communications

The performance of the MPI's collective communications is critical in most MPI-based applications. A general algorithm for a given collective communication operation may not give good performance on all systems due to the differences in architectures, ...

Comments

Information & Contributors

Information

Published In

ACM SIGPLAN Notices Volume 47, Issue 8

PPOPP '12

August 2012

334 pages

ISSN:0362-1340

EISSN:1558-1160

DOI:10.1145/2370036

Issue’s Table of Contents

PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
February 2012
352 pages
ISBN:9781450311601
DOI:10.1145/2145816
General Chair:
J. Ramanujam
Louisiana State University, USA
,
Program Chair:
P. Sadayappan
The Ohio State University, USA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 February 2012

Published in SIGPLAN Volume 47, Issue 8

Check for updates

Author Tags

Qualifiers

Poster

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
165
Total Downloads

Downloads (Last 12 months)5
Downloads (Last 6 weeks)0

Reflects downloads up to 09 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guo JYi QMeng JZhang JBalaji P(2016)Compiler-Assisted Overlapping of Communication and Computation in MPI Applications2016 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER.2016.62(60-69)Online publication date: Sep-2016
https://doi.org/10.1109/CLUSTER.2016.62
Zahavi EKeslassy IKolodny A(2014)Quasi Fat Trees for HPC Clouds and Their Fault-Resilient Closed-Form RoutingProceedings of the 2014 IEEE 22nd Annual Symposium on High-Performance Interconnects10.1109/HOTI.2014.19(41-48)Online publication date: 26-Aug-2014
https://dl.acm.org/doi/10.1109/HOTI.2014.19

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Collective algorithms for sub-communicators

Collective algorithms for sub-communicators

Towards an Accurate Model for Collective Communications