Article thumbnail

Collective Algorithms for Sub-communicators

By Anshul Mittal, Thomas George, Yogish Sabharwal and Nikhil Jain

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 subcommunicators 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. D.m [Software]: Miscella

Topics: Performance, Algorithms Collectives, Torus, Sub-communicators MPI
Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.366.7786
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://charm.cs.illinois.edu/n... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.