Online dynamic power management with hard real-time guarantees

DOI10.1016/j.tcs.2015.06.014zbMath1328.68036MaRDI QIDQ2354765

Ignaz Rutter, Jian-Jia Chen, Mong-Jen Kao, Dorothea Wagner, Der-Tsai Lee

Publication date: 24 July 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.014

zbMATH Keywords

dynamic power management; online energy-efficient scheduling

Mathematics Subject Classification ID

68M20: Performance evaluation, queueing, and scheduling in the context of computer systems

68W27: Online algorithms; streaming algorithms

Related Items

A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applying real-time interface and calculus for dynamic power management in hard real-time systems
• Competitive randomized algorithms for nonuniform problems
• Clairvoyance and online scheduling in real-time energy harvesting systems
• Scheduling to minimize gaps and power consumption
• Meeting Deadlines: How Much Speed Suffices?
• Polynomial Time Algorithms for Minimum Energy Scheduling
• Optimal Power-Down Strategies
• A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
• Speed scaling to manage energy and temperature
• Scheduling unit tasks to minimize the number of idle periods
• Resource Minimization Job Scheduling
• Competitive Design and Analysis for Machine-Minimizing Job Scheduling Problem
• A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
• Race to idle