Hierarchical Collectives in MPICH2

  • Authors:
  • Hao Zhu;David Goodell;William Gropp;Rajeev Thakur

  • Affiliations:
  • Department of Computer Science, University of Illinois, Urbana, USA 61801;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA 60439;Department of Computer Science, University of Illinois, Urbana, USA 61801;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA 60439

  • Venue:
  • Proceedings of the 16th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
  • Year:
  • 2009

Quantified Score

Hi-index 0.01

Visualization

Abstract

Most parallel systems on which MPI is used are now hierarchical, such as systems with SMP nodes. Many papers have shown algorithms that exploit shared memory to optimize collective operations to good effect. But how much of the performance benefit comes from tailoring the algorithm to the hierarchical topology of the system? We describe an implementation of many of the MPI collectives based entirely on message-passing primitives that exploits the two-level hierarchy. Our results show that exploiting shared memory directly usually gives small additional benefit and suggests design approaches for where the benefit is large.