Speed scaling with an arbitrary power function

DOI10.1145/2438645.2438650MaRDI QIDQ2933648zbMATH OpenOpenAlexFDO

Authors N. Bansal, Ho-Leung Chan, Kirk Pruhs

Publication date 5 December 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.7723

zbMATH Keywords

schedulingspeed scaling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Speed scaling with an arbitrary power function
• Online speed scaling based on active job count to minimize flow plus energy
• Speed scaling for stretch plus energy
• Nonclairvoyant speed scaling for flow and energy
• Nonclairvoyant speed scaling for flow and energy

Cited in

(34)

• Speed scaling with a solar cell
• Scheduling on power-heterogeneous processors
• Scheduling to minimize energy and flow time in broadcast scheduling
• A fully polynomial-time approximation scheme for speed scaling with a sleep state
• Online speed scaling based on active job count to minimize flow plus energy
• Efficient computation of optimal energy and fractional weighted flow trade-off schedules
• Rate-adaptive weighted fair queueing for energy-aware scheduling
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting
• A survey of offline algorithms for energy minimization under deadline constraints
• An online algorithm optimally self-tuning to congestion for power management problems
• On the complexity of speed scaling
• Optimal speed scaling with a solar cell (extended abstract)
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Sleep management on multiple machines for energy and flow time
• Algorithms for dynamic speed scaling
• Speed Scaling with a Solar Cell
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
• Speed scaling for weighted flow time
• Flow shop scheduling with peak power consumption constraints
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Speed scaling for stretch plus energy
• Primal dual gives almost optimal energy-efficient online algorithms
• Speed scaling with an arbitrary power function
• Continuous speed scaling with variability: a simple and direct approach
• Average Rate Speed Scaling
• Average rate speed scaling
• Race to idle: new algorithms for speed scaling with a sleep state
• Resource augmentation for weighted flow-time explained by dual fitting
• Scheduling heterogeneous processors isn't as easy as you think
• Race to idle: new algorithms for speed scaling with a sleep state
• Min-energy scheduling for aligned jobs in accelerate model
• Station assignment with reallocation
• Deadline scheduling and power management for speed bounded processors
• Energy optimal schedules for jobs with multiple active intervals

This page was built for publication: Speed scaling with an arbitrary power function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2933648)