Volume 8 (2012) Article 9 pp. 209-229
Special Issue in Honor of Rajeev Motwani
Improved Bounds for Speed Scaling in Devices Obeying the Cube-Root Rule
by
Published: May 25, 2012
[PDF (248K)]    [PS (1034K)]    [PS.GZ (273K)]
[Source ZIP]
Keywords: scheduling, energy minimization, speed-scaling, online algorithms
ACM Classification: F.2.2
AMS Classification: 68Q25

Abstract: [Plain Text Version]

Speed scaling is a power management technology that involves dynamically changing the speed of a processor. This technology gives rise to dual-objective scheduling problems, where the operating system both wants to conserve energy and optimize some Quality of Service (QoS) measure of the resulting schedule. In the most investigated speed scaling problem in the literature, the QoS constraint is deadline feasibility, and the objective is to minimize the energy used. The standard assumption is that the processor power is of the form $s^\alpha$ where $s$ is the processor speed, and $\alpha > 1$ is some constant; $\alpha \approx 3$ for CMOS based processors.

In this paper we introduce and analyze a natural class of speed scaling algorithms, that we call $\mathrm{qOA}$. The algorithm $\mathrm{qOA}$ sets the speed of the processor to be $q$ times the speed that the optimal offline algorithm would run the jobs in the current state. When $\alpha=3$, we show that $\mathrm{qOA}$ is 6.7-competitive, improving upon the previous best guarantee of 27 achieved by the algorithm Optimal Available ($\mathrm{OA}$). We also give almost matching upper and lower bounds for $\mathrm{qOA}$ for general $\alpha$. Finally, we give the first non-trivial lower bound, namely $e^{\alpha-1}/\alpha$, on the competitive ratio of a general deterministic online algorithm for this problem.