Three dozen papers on online algorithms
ACM SIGACT News
Algorithmic problems in power management
ACM SIGACT News
Scheduling to minimize gaps and power consumption
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Speed scaling on parallel processors
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms (TALG)
Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
Getting the best response for your erg
ACM Transactions on Algorithms (TALG)
Competitive non-migratory scheduling for flow time and energy
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Sleep with Guilt and Work Faster to Minimize Flow Plus Energy
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Energy consumption in mobile phones: a measurement study and implications for network applications
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
Polynomial time algorithms for minimum energy scheduling
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Scheduling to minimize power consumption using submodular functions
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Deadline scheduling and power management for speed bounded processors
Theoretical Computer Science
Adaptive power management for real-time event streams
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
SIGACT news online algorithms column 17
ACM SIGACT News
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
CODES+ISSS '11 Proceedings of the seventh IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Energy-Efficient algorithms for flow time minimization
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Min-energy voltage allocation for tree-structured tasks
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Speed scaling to manage temperature
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Polynomial-time algorithms for minimum energy scheduling
ACM Transactions on Algorithms (TALG)
An online algorithm optimally self-tuning to congestion for power management problems
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Optimal DPM and DVFS for frame-based real-time systems
ACM Transactions on Architecture and Code Optimization (TACO) - Special Issue on High-Performance Embedded Architectures and Compilers
Assessing Green Strategies in Peer-to-Peer Opportunistic Grids
Journal of Grid Computing
Scheduling to minimize gaps and power consumption
Journal of Scheduling
| Hi-index | 0.00 |
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.