ACM Home Page
Please provide us with feedback. Feedback
Bounding energy consumption in large-scale MPI programs
Full text PdfPdf (135 KB)
Source
Conference on High Performance Networking and Computing archive
Proceedings of the 2007 ACM/IEEE conference on Supercomputing - Volume 00 table of contents
Reno, Nevada
SESSION: Modeling in action table of contents
Article No. 49  
Year of Publication: 2007
ISBN:978-1-59593-764-3
Authors
Barry Rountree  University of Georgia, Athens, GA
David K. Lowenthal  University of Georgia, Athens, GA
Shelby Funk  University of Georgia, Athens, GA
Vincent W. Freeh  North Carolina State University, Raleigh, NC
Bronis R. de Supinski  Lawrence Livermore National Laboratory, Livermore, CA
Martin Schulz  Lawrence Livermore National Laboratory, Livermore, CA
Sponsors
IEEE-CS\DATC : IEEE Computer Society
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 44,   Citation Count: 4
Additional Information:

abstract   references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1362622.1362688
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
E. Elnozahy, M. Kistler, and R. Rajamony. Energy-efficient server clusters. In Workshop on Power-Aware Computing Systems, February 2002.
3
 
4
R. Ge and K. W. Cameron. Power-aware speedup. In In Proceedings of the 21st IEEE International Parallel and Distributed Processing Symposium (IPDPS 07), March 2007.
 
5
D. Grunwald, P. Levis, K. Farkas, C. Morrey, and M. Neufeld. Policies for dynamic clock scheduling. In Operating System Design and Implementation, October 2000.
 
6
Wayne A. Haga and Tim O'Keefe. Crashing pert networks: A simulation approach. In 4th International Conference of the Academy of Business and Administrative Sciences Conference, July 2001.
 
7
C. Hsu, W. Feng, and J. S. Archuleta. Towards efficient supercomputing: A quest for the right metric. In Workshop on High-Performance, Power-Aware Computing, April 2005.
8
 
9
10
 
11
 
12
Lawrence Livermore National Laboratory. The ASCI Purple Benchmarks. http://www.llnl.gov/asci/platforms/purple/rfp/benchmarks, 2001.
 
13
Lawrence Livermore National Laboratory. The UMT Benchmark Code. http://www.llnl.gov/asci/platforms/purple/rfp/benchmarks/limited/umt/, January 2002.
14
 
15
Andrew Makhorin. GNU Linear Programming Kit. http://www.gnu.org/software/glpk/glpk.html, January 2005.
16
 
17
 
18
B. Mohr and F. Wolf. KOJAK - a tool set for automatic performance analysis of parallel applications. In Proc. of the European Conference on Parallel Computing (EuroPar), August 2003.
 
19
M. Angels Moncusi, Alex Arenas, and Jesus Labarta. Energy aware EDF scheduling in distributed hard real time systems. In Real-Time Systems Symposium, December 2003.
20
 
21
M. Noeth, F. Mueller, M. Schulz, and B. de Supinski. Scalable compression and replay of communication traces in massively parallel environments. In International Parallel and Distributed Processing Symposium (IPDPS), April 2007.
 
22
 
23
Barry Render and Ralph M. Stair Jr. Quantitative Analysis for Management. Prentice-Hall, seventh edition, 2000.
24
 
25
 
26
 
27
28
29
 
30
Vishnu Swaminathan and Krshnendu Chakrabarty. Real-time task scheduling for energy-aware embedded systems. In IEEE Real-Time Systems Symposium, November 2000.
 
31
OpenMPI Development Team. OpenMPI. http://www.open-mpi.org, 2006.
 
32
 
33
 
34
35
36
37
38
 
39

Collaborative Colleagues:
Barry Rountree: colleagues
David K. Lowenthal: colleagues
Shelby Funk: colleagues
Vincent W. Freeh: colleagues
Bronis R. de Supinski: colleagues
Martin Schulz: colleagues