Polynomial-time algorithms for minimum energy scheduling
From MaRDI portal
Recommendations
- Polynomial Time Algorithms for Minimum Energy Scheduling
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption
- Non-preemptive throughput maximization for speed-scaling with power-down
Cited in
(15)- A polynomial-time scheduling approach to minimise idle energy consumption: an application to an industrial furnace
- Scheduling with gaps: new models and algorithms
- A fully polynomial-time approximation scheme for speed scaling with a sleep state
- A greedy approximation algorithm for minimum-gap scheduling
- A survey of offline algorithms for energy minimization under deadline constraints
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
- Polynomial Time Algorithms for Minimum Energy Scheduling
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Energy-efficient algorithms for flow time minimization
- Race to idle: new algorithms for speed scaling with a sleep state
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Minimizing the cost of batch calibrations
- Minimizing energy on homogeneous processors with shared memory
- An O(n^3)-time algorithm for the min-gap unit-length job scheduling problem
- Power and performance management for parallel computations in clouds and data centers
This page was built for publication: Polynomial-time algorithms for minimum energy scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189067)
