A new approach to MPI collective communication implementations

1Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Recent research into the optimization of collectiveMPIoperations has resulted in a wide variety of algorithms and corresponding implementations, each typically only applicable in a relatively narrow scope: on a specific architecture, on a specific network, with a specific number of processes, with a specific data size and/or data-type . or any combination of these (or other) factors. This situation presents an enormous challenge to portable MPI implementations which are expected to provide optimized collective operation performance on all platforms. Many portable implementations have attempted to provide a token number of algorithms that are intended to realize good performance on most systems. However, many platform configurations are still left without well-tuned collective operations. This paper presents a proposal for a framework that will allow a wide variety of collective algorithm implementations and a flexible, multi-tiered selection process for choosing which implementation to use when an application invokes an MPI collective function.

Cite

CITATION STYLE

APA

Hoefler, T., Squyres, J. M., Fagg, G. E., Bosilca, G., Rehm, W., & Lumsdaine, A. (2007). A new approach to MPI collective communication implementations. In Distributed and Parallel Systems: From Cluster to Grid Computing (pp. 45–54). Springer US. https://doi.org/10.1007/978-0-387-69858-8_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free