Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Improving dynamic voltage scaling algorithms with PACE

Jacob R. Lorch and Alan Jay Smith

Abstract

This paper addresses algorithms for dynamically varying (scaling) CPU speed and voltage in order to save energy. Such scaling is useful and effective when it is immaterial when a task completes, as long as it meets some deadline. We show how to modify any scaling algorithm to keep performance the same but minimize expected energy consumption. We refer to our approach as PACE (Processor Acceleration to Conserve Energy) since the resulting schedule increases speed as the task progresses. Since PACE depends on the probability distribution of the task’s work requirement, we present methods for estimating this distribution and evaluate these methods on a variety of real workloads. We also show how to approximate the optimal schedule with one that changes speed a limited number of times. Using PACE causes very little additional overhead, and yields substantial reductions in CPU energy consumption. Simulations using real workloads show it reduces the CPU energy consumption of previously published algorithms by up to 49.5%, with an average of 20.6%, without any effect on performance.

Details

Publication typeInproceedings
Published inProceedings of the ACM SIGMETRICS 2001 Conference
Pages50–61
AddressCambridge, MA
PublisherAssociation for Computing Machinery, Inc.
> Publications > Improving dynamic voltage scaling algorithms with PACE