Title

AM++: A Generalized Active Message Framework

Abstract

Active messages have been shown to be a good model to express irregular applications for distributed-memory systems.  However, current active messaging frameworks are either too inflexible or too inefficient for use by graph algorithms.  We have developed a new framework, AM++, for "generalized active messages" that provides both efficiency and flexibility.  It also provides features such as flexible, user-configurable message coalescing and duplicate message elimination without users needing to entangle those behaviors into their applications. Implementation and benchmarking of graph algorithms using AM++ shows the usability benefits of the new features.  I will also briefly discuss my work on the Graph 500 benchmark: the graph generators, MPI reference implementations, and the Argonne entry to the first Graph 500 list.                                                                                 

Bio

Jeremiah Willcock is a postdoctoral researcher in the Open Systems Lab at Indiana University.  He received his Ph.D. from Indiana University in the area of generic compiler optimizations, then was a postdoctoral researcher in the ROSE project at Lawrence Livermore National Laboratory, in the area of program analysis.  His current research interests include abstractions for high-performance and parallel computing, especially in the area of graph algorithms, and programming language features for generic programming.

Host

David Bader

Followed by questions with PIZZA and DRINKS