Communications of the ACM
Energy efficient scheduling via partial shutdown
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Software for improving the energy efficiency of a computer cluster
Programming and Computing Software
Algorithms for energy management
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
On the best possible competitive ratio for multislope ski rental
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Dynamic right-sizing for power-proportional data centers
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.03 |
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.