Continuous speed scaling with variability: a simple and direct approach
From MaRDI portal
Recommendations
Cites work
- Algorithms for dynamic speed scaling
- An O(n^2) algorithm for computing optimal continuous voltage schedules
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
- Energy-efficient algorithms for flow time minimization
- scientific article; zbMATH DE number 1250615 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- Optimization in function spaces. With stability considerations in Orlicz spaces.
- Optimizing throughput and energy in online deadline scheduling
- Speed scaling to manage energy and temperature
- Speed scaling with a solar cell
- Speed scaling with an arbitrary power function
Cited in
(5)
This page was built for publication: Continuous speed scaling with variability: a simple and direct approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q526899)