%0 Journal Article %1 lorch04pace %A Lorch, J.R. %A Smith, A.J. %C Washington, DC, USA %D 2004 %I IEEE Computer Society %J IEEE Trans. Comput. %K Algorithms DVS Estimation Workload %N 7 %P 856--869 %R http://dx.doi.org/10.1109/TC.2004.35 %T PACE: A New Approach to Dynamic Voltage Scaling %U http://dx.doi.org/10.1109/TC.2004.35 %V 53 %X By dynamically varying CPU speed and voltage, it is possible to save significant amounts of energy while still meeting prespecified soft or hard deadlines for tasks; numerous algorithms have been published with this goal. We show that it is possible to modify any voltage scaling algorithm to minimize energy use without affecting perceived performance and present a formula to do so optimally. Because this formula specifies increased speed as the task progresses, we call this approach PACE (Processor Acceleration to Conserve Energy). This optimal formula depends on the probability distribution of the task's work requirement and requires that the speed be varied continuously. We therefore present methods for estimating the task work distribution and evaluate how effective they are on a variety of real workloads. We also show how to approximate the optimal continuous schedule with one that changes speed a limited number of times. Using these methods, we find we can apply PACE practically and efficiently. Furthermore, PACE is extremely effective: Simulations using real workloads and the standard model for energy consumption as a function of voltage show that PACE can reduce the CPU energy consumption of existing algorithms by up to 49.5 percent, with an average of 20.6 percent, without any effect on perceived performance. The consequent PACE-modified algorithms reduce CPU energy consumption by an average of 65.4 percent relative to no dynamic voltage scaling, as opposed to only 54.3 percent without PACE.

@article{lorch04pace, abstract = {By dynamically varying CPU speed and voltage, it is possible to save significant amounts of energy while still meeting prespecified soft or hard deadlines for tasks; numerous algorithms have been published with this goal. We show that it is possible to modify any voltage scaling algorithm to minimize energy use without affecting perceived performance and present a formula to do so optimally. Because this formula specifies increased speed as the task progresses, we call this approach PACE (Processor Acceleration to Conserve Energy). This optimal formula depends on the probability distribution of the task's work requirement and requires that the speed be varied continuously. We therefore present methods for estimating the task work distribution and evaluate how effective they are on a variety of real workloads. We also show how to approximate the optimal continuous schedule with one that changes speed a limited number of times. Using these methods, we find we can apply PACE practically and efficiently. Furthermore, PACE is extremely effective: Simulations using real workloads and the standard model for energy consumption as a function of voltage show that PACE can reduce the CPU energy consumption of existing algorithms by up to 49.5 percent, with an average of 20.6 percent, without any effect on perceived performance. The consequent PACE-modified algorithms reduce CPU energy consumption by an average of 65.4 percent relative to no dynamic voltage scaling, as opposed to only 54.3 percent without PACE.}, added-at = {2008-02-25T11:44:18.000+0100}, address = {Washington, DC, USA}, author = {Lorch, J.R. and Smith, A.J.}, biburl = {https://www.bibsonomy.org/bibtex/27a9899cc74115a7481d91257e7a7416d/derkling}, description = {PACE}, doi = {http://dx.doi.org/10.1109/TC.2004.35}, interhash = {f417639af69add5f173fe064e35dce99}, intrahash = {7a9899cc74115a7481d91257e7a7416d}, issn = {0018-9340}, journal = {IEEE Trans. Comput.}, keywords = {Algorithms DVS Estimation Workload}, number = 7, pages = {856--869}, publisher = {IEEE Computer Society}, timestamp = {2008-02-25T11:44:19.000+0100}, title = {PACE: A New Approach to Dynamic Voltage Scaling}, url = {http://dx.doi.org/10.1109/TC.2004.35}, volume = 53, year = 2004 }