Speed Scaling with an Arbitrary Power Function
From MaRDI portal
Publication:2933648
DOI10.1145/2438645.2438650zbMath1301.90026OpenAlexW2097190088MaRDI QIDQ2933648
Ho-Leung Chan, Nikhil Bansal, Kirk R. 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
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (21)
A survey of offline algorithms for energy minimization under deadline constraints ⋮ Energy optimal schedules for jobs with multiple active intervals ⋮ Online speed scaling based on active job count to minimize flow plus energy ⋮ Flow shop scheduling with peak power consumption constraints ⋮ Efficient computation of optimal energy and fractional weighted flow trade-off schedules ⋮ Scheduling on power-heterogeneous processors ⋮ On the Complexity of Speed Scaling ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Min-energy scheduling for aligned jobs in accelerate model ⋮ Station assignment with reallocation ⋮ Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines ⋮ Sleep Management on Multiple Machines for Energy and Flow Time ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ Deadline scheduling and power management for speed bounded processors ⋮ Scheduling to minimize energy and flow time in broadcast scheduling ⋮ A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state ⋮ Race to idle ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: Speed Scaling with an Arbitrary Power Function
