Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
DOI10.1016/J.TCS.2010.10.011zbMATH Open1217.68247OpenAlexW1986373871MaRDI QIDQ553339FDOQ553339
Authors: 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
Recommendations
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- scientific article; zbMATH DE number 2080247
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Min-energy voltage allocation for tree-structured tasks
- Computing and Combinatorics
- An \(O(n^2)\) algorithm for computing optimal continuous voltage schedules
- Polynomial-time algorithms for minimum energy scheduling
- A survey of offline algorithms for energy minimization under deadline constraints
- Polynomial Time Algorithms for Minimum Energy Scheduling
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Speed scaling to manage energy and temperature
- Two-Processor Scheduling with Start-Times and Deadlines
- Approximating the throughput of multiple machines in real-time scheduling
- On the approximability of an interval scheduling problem
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
- $\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
Cited In (6)
- Continuous speed scaling with variability: a simple and direct approach
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Throughput maximization in multiprocessor speed-scaling
- Throughput Maximization in Multiprocessor Speed-Scaling
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
- Throughput maximization for speed scaling with agreeable deadlines
This page was built for publication: Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q553339)
