|
Published Articles >> Table of Contents >> Abstract
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04)
pp. 530-539
Optimal Power-Down Strategies
John Augustine, University of California at Irvine
Sandy Irani, University of California at Irvine
Chaitanya Swamy, Cornell University
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FOCS.2004.50
Send link to a friend
| Abstract |
|
We consider the problem of selecting threshold times to transition a device to low-power sleep states during an idle period. The two-state case in which there is a single active and a single sleep state is a continuous version of the ski-rental problem. We consider a generalized version in which there is more than one sleep state, each with its own power consumption rate and transition costs. We give an algorithm that, given a system, produces a deterministic strategy whose competitive ratio is arbitrarily close to optimal. We also give an algorithm to produce the optimal online strategy given a system and a probability distribution that generates the length of the idle period. We also give a simple algorithm that achieves a competitive ratio of 3 + 2\sqrt 2 \approx 5.828 for any system.
|
 Additional Information
|
Citation:
John Augustine, Sandy Irani, Chaitanya Swamy,
"Optimal Power-Down Strategies,"
focs,
pp. 530-539,
45th Annual IEEE Symposium on Foundations of Computer Science (FOCS'04),
2004
|
|
