The Community for Technology Leaders
2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT) (2010)
Vienna, Austria
Sept. 11, 2010 to Sept. 15, 2010
ISBN: 978-1-5090-5032-1
pp: 401-410
Jeremiah J. Willcock , Indiana University, 150 S. Woodlawn Ave, Bloomington, IN 47401, USA
Torsten Hoefler , University of Illinois at Urbana-Champaign, 1205 W. Clark St., 61801, USA
Nicholas G. Edmonds , Indiana University, 150 S. Woodlawn Ave, Bloomington, IN 47401, USA
Andrew Lumsdaine , Indiana University, 150 S. Woodlawn Ave, Bloomington, IN 47401, USA
ABSTRACT
Active messages have proven to be an effective approach for certain communication problems in high performance computing. Many MPI implementations, as well as runtimes for Partitioned Global Address Space languages, use active messages in their low-level transport layers. However, most active message frameworks have low-level programming interfaces that require significant programming effort to use directly in applications and that also prevent optimization opportunities. In this paper we present AM++, a new user-level library for active messages based on generic programming techniques. Our library allows message handlers to be run in an explicit loop that can be optimized and vectorized by the compiler and that can also be executed in parallel on multicore architectures. Runtime optimizations, such as message combining and filtering, are also provided by the library, removing the need to implement that functionality at the application level. Evaluation of AM++ with distributed-memory graph algorithms shows the usability benefits provided by these library features, as well as their performance advantages.
INDEX TERMS
Parallel Programming Interfaces, Active Messages, Parallel Graph Algorithms
CITATION
Jeremiah J. Willcock, Torsten Hoefler, Nicholas G. Edmonds, Andrew Lumsdaine, "AM++: A generalized active message framework", 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT), vol. 00, no. , pp. 401-410, 2010, doi:
101 ms
(Ver 3.3 (11022016))