Nonclairvoyant speed scaling for flow and energy
From MaRDI portal
(Redirected from Publication:644794)
Recommendations
- Nonclairvoyant speed scaling for flow and energy
- Non-clairvoyant Speed Scaling for Weighted Flow Time
- Speed scaling with an arbitrary power function
- Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
Cites work
- Algorithm Theory - SWAT 2004
- Energy-Efficient Algorithms for Flow Time Minimization
- Minimizing flow time nonclairvoyantly
- Nonclairvoyant scheduling
- Nonclairvoyant scheduling to minimize the total flow time on single and parallel machines
- Online weighted flow time and deadline scheduling
- Scalably scheduling processes with arbitrary speedup curves
- Scheduling for Speed Bounded Processors
- Scheduling in the dark
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed is as powerful as clairvoyance
- Speed scaling for weighted flow time
Cited in
(10)- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Energy-efficient multiprocessor scheduling for flow time and makespan
- Online primal-dual for non-linear optimization with applications to speed scaling
- Speed scaling for stretch plus energy
- Speed scaling with an arbitrary power function
- Robust online speed scaling with deadline uncertainty
- Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
- Nonclairvoyant speed scaling for flow and energy
- Speed scaling with an arbitrary power function
- Non-clairvoyant Speed Scaling for Weighted Flow Time
This page was built for publication: Nonclairvoyant speed scaling for flow and energy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644794)