Stochastic Analysis of Power-Aware Scheduling
Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the processing speed to the current load. This paper studies the optimal way to adjust speed to balance mean response time and mean energy consumption, when jobs arrive as a Poisson process and processor sharing scheduling is used. Both bounds and asymptotics for the optimal speeds are provided. Interestingly, a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, dynamic speed scaling which allocates a higher speed when more jobs are present significantly improves robustness to bursty traffic and mis-estimation of workload parameters.
© 2008 IEEE. Issue Date: 23-26 Sept. 2008; Date of Current Version: 04 March 2009. This work was supported by grants from NSF CCF 0830511 and CNS 0435520, Microsoft Research and the Lee Center for Advanced Networking.
|178.4 kB||Preview Download|