A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
From MaRDI portal
Publication:5363002
DOI10.1137/1.9781611973730.74zbMath1372.68041arXiv1407.0892OpenAlexW2949793410MaRDI QIDQ5363002
Sebastian Ott, Chien-Chung Huang, Antonios Foivos Antoniadis
Publication date: 5 October 2017
Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1407.0892
Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (5)
A survey of offline algorithms for energy minimization under deadline constraints ⋮ Race to idle or not: balancing the memory sleep time with DVS for energy minimization ⋮ Speed scaling problems with memory/cache consideration ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state ⋮ Online dynamic power management with hard real-time guarantees
This page was built for publication: A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
