A fully polynomial-time approximation scheme for speed scaling with a sleep state
From MaRDI portal
Publication:2319643
Recommendations
- A fully polynomial-time approximation scheme for speed scaling with sleep state
- Race to idle: new algorithms for speed scaling with a sleep state
- Race to idle: new algorithms for speed scaling with a sleep state
- New online algorithm for dynamic speed scaling with sleep state
- Speed-scaling with no preemptions
Cites work
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- A fully polynomial-time approximation scheme for speed scaling with sleep state
- Algorithms for power savings
- Deadline scheduling and power management for speed bounded processors
- From preemptive to non-preemptive speed-scaling scheduling
- Improved bounds for speed scaling in devices obeying the cube-root rule
- New Results for Non-Preemptive Speed Scaling
- On the NP-hardness of speed scaling with sleep state
- Polynomial-time algorithms for minimum energy scheduling
- Race to idle: new algorithms for speed scaling with a sleep state
- Scheduling to minimize gaps and power consumption
- Scheduling unit tasks to minimize the number of idle periods
- Speed scaling with an arbitrary power function
Cited in
(6)- A fully polynomial-time approximation scheme for speed scaling with sleep state
- On the NP-hardness of speed scaling with sleep state
- New online algorithm for dynamic speed scaling with sleep state
- Race to idle: new algorithms for speed scaling with a sleep state
- Race to idle: new algorithms for speed scaling with a sleep state
- Minimizing energy on homogeneous processors with shared memory
This page was built for publication: A fully polynomial-time approximation scheme for speed scaling with a sleep state
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2319643)