Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics

DOI10.1007/978-3-642-10631-6_39zbMath1273.68352OpenAlexW1491458557MaRDI QIDQ3652225

Minming Li

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_39

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the approximability of an interval scheduling problem
• Approximating the Throughput of Multiple Machines in Real-Time Scheduling
• Speed scaling to manage energy and temperature
• Two-Processor Scheduling with Start-Times and Deadlines
• $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules

This page was built for publication: Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics