Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics

DOI10.1016/j.tcs.2010.10.011zbMath1217.68247OpenAlexW1986373871MaRDI QIDQ553339

Minming Li

Publication date: 27 July 2011

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

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

zbMATH Keywords

approximation algorithmsthroughputminimum energydynamic voltage scalingonline heuristics

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Related Items (4)

Throughput maximization in multiprocessor speed-scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Throughput maximization for speed scaling with agreeable deadlines ⋮ Continuous speed scaling with variability: a simple and direct approach

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics