Malleable iterative MPI applications

  • Authors:
  • K. El Maghraoui;Travis J. Desell;Boleslaw K. Szymanski;Carlos A. Varela

  • Affiliations:
  • IBM T.J. Watson Research Center, Yorktown Heights, New York, NY 10598, U.S.A.;Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180-3590, U.S.A.;Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180-3590, U.S.A.;Department of Computer Science, Rensselaer Polytechnic Institute, 110 8th Street, Troy, NY 12180-3590, U.S.A.

  • Venue:
  • Concurrency and Computation: Practice & Experience - The Best of CCGrid'2007: A Snapshot of an ‘Adolescent’ Area
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Malleability enables a parallel application's execution system to split or merge processes modifying granularity. While process migration is widely used to adapt applications to dynamic execution environments, it is limited by the granularity of the application's processes. Malleability empowers process migration by allowing the application's processes to expand or shrink following the availability of resources. We have implemented malleability as an extension to the process checkpointing and migration (PCM) library, a user-level library for iterative message passing interface (MPI) applications. PCM is integrated with the Internet Operating System, a framework for middleware-driven dynamic application reconfiguration. Our approach requires minimal code modifications and enables transparent middleware-triggered reconfiguration. Experimental results using a two-dimensional data parallel program that has a regular communication structure demonstrate the usefulness of malleability. Copyright © 2008 John Wiley & Sons, Ltd.