Bounding energy consumption in large-scale MPI programs

Barry Rountree, David K. Lowenthal, Shelby Funk, Vincent W. Freeh, Bronis R. De Supinski, Martin Schulz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

123 Scopus citations


Power is now a first-order design constraint in large-scale parallel computing. Used carefully, dynamic voltage scaling can execute parts of a program at a slower CPU speed to achieve energy savings with a relatively small (possibly zero) time delay. However, the problem of when to change frequencies in order to optimize energy savings is NP-complete, which has led to many heuristic energy-saving algorithms. To determine how closely these algorithms approach optimal savings, we developed a system that determines a bound on the energy savings for an application. Our system uses a linear programming solver that takes as inputs the application communication trace and the cluster power characteristics and then outputs a schedule that realizes this bound. We apply our system to three scientific programs, two of which exhibit load imbalance - particle simulation and UMT2K. Results from our bounding technique show particle simulation is more amenable to energy savings than UMT2K. (c) 2007 ACM.

Original languageEnglish (US)
Title of host publicationProceedings of the 2007 ACM/IEEE Conference on Supercomputing, SC'07
StatePublished - 2007
Event2007 ACM/IEEE Conference on Supercomputing, SC'07 - Reno, NV, United States
Duration: Nov 10 2007Nov 16 2007

Publication series

NameProceedings of the 2007 ACM/IEEE Conference on Supercomputing, SC'07


Other2007 ACM/IEEE Conference on Supercomputing, SC'07
Country/TerritoryUnited States
CityReno, NV

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software
  • Electrical and Electronic Engineering


Dive into the research topics of 'Bounding energy consumption in large-scale MPI programs'. Together they form a unique fingerprint.

Cite this