TY - GEN
T1 - Just in time dynamic voltage scaling
T2 - ACM/IEEE 2005 Supercomputing Conference, SC'05
AU - Kappiah, Nandini
AU - Freeh, Vincent W.
AU - Lowenthal, David K.
PY - 2005
Y1 - 2005
N2 - Recently, improving the energy efficiency of HPC machines has become important. As a result, interest in using power-scalable clusters, where frequency and voltage can be dynamically modified, has increased. On power-scalable clusters, one opportunity for saving energy with little or no loss of performance exists when the computational load is not perfectly balanced. This situation occurs frequently, as balancing load between nodes is one of the long standing problems in parallel and distributed computing. In this paper we present a system called Jitter, which reduces the frequency on nodes that are assigned less computation and therefore have slack time. This saves energy on these nodes, and the goal of Jitter is to attempt to ensure that they arrive "just in time" so that they avoid increasing overall execution time. For example, in Aztec, from the ASCI Purple suite, our algorithm uses 8% less energy while increasing execution time by only 2.6%.
AB - Recently, improving the energy efficiency of HPC machines has become important. As a result, interest in using power-scalable clusters, where frequency and voltage can be dynamically modified, has increased. On power-scalable clusters, one opportunity for saving energy with little or no loss of performance exists when the computational load is not perfectly balanced. This situation occurs frequently, as balancing load between nodes is one of the long standing problems in parallel and distributed computing. In this paper we present a system called Jitter, which reduces the frequency on nodes that are assigned less computation and therefore have slack time. This saves energy on these nodes, and the goal of Jitter is to attempt to ensure that they arrive "just in time" so that they avoid increasing overall execution time. For example, in Aztec, from the ASCI Purple suite, our algorithm uses 8% less energy while increasing execution time by only 2.6%.
UR - http://www.scopus.com/inward/record.url?scp=33845438524&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33845438524&partnerID=8YFLogxK
U2 - 10.1109/SC.2005.39
DO - 10.1109/SC.2005.39
M3 - Conference contribution
AN - SCOPUS:33845438524
SN - 1595930612
SN - 9781595930613
T3 - Proceedings of the ACM/IEEE 2005 Supercomputing Conference, SC'05
BT - Proceedings - Thirteenth International Symposium on Temporal Representation and Reasoning, TIME 2006
Y2 - 12 November 2005 through 18 November 2005
ER -