Polynomial-time algorithms for minimum energy scheduling
From MaRDI portal
Publication:3189067
DOI10.1145/2229163.2229170zbMath1295.68045OpenAlexW2116668770MaRDI QIDQ3189067
Philippe Baptiste, Christoph Dürr, Marek Chrobak
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2010/2535/
Nonnumerical algorithms (68W05) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (9)
A survey of offline algorithms for energy minimization under deadline constraints ⋮ A greedy approximation algorithm for minimum-gap scheduling ⋮ Power and performance management for parallel computations in clouds and data centers ⋮ An \(O(n^3)\)-time algorithm for the min-gap unit-length job scheduling problem ⋮ Minimizing the cost of batch calibrations ⋮ Minimizing energy on homogeneous processors with shared memory ⋮ Scheduling with gaps: new models and algorithms ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state ⋮ Race to idle
This page was built for publication: Polynomial-time algorithms for minimum energy scheduling
