Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
From MaRDI portal
Publication:553339
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
Cites work
- scientific article; zbMATH DE number 6381709 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- $\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
- Approximating the throughput of multiple machines in real-time scheduling
- On the approximability of an interval scheduling problem
- Speed scaling to manage energy and temperature
- Two-Processor Scheduling with Start-Times and Deadlines
Cited in
(6)- Continuous speed scaling with variability: a simple and direct approach
- Throughput maximization in multiprocessor speed-scaling
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- 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)