New Results for Non-Preemptive Speed Scaling
From MaRDI portal
Publication:2922622
DOI10.1007/978-3-662-44465-8_31zbMath1426.68029OpenAlexW2137563419MaRDI QIDQ2922622
Sebastian Ott, Chien-Chung Huang
Publication date: 14 October 2014
Published in: Mathematical Foundations of Computer Science 2014 (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0024-03BF-D
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (6)
Throughput maximization in multiprocessor speed-scaling ⋮ A survey of offline algorithms for energy minimization under deadline constraints ⋮ Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Online interval scheduling with a bounded number of failures ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state
This page was built for publication: New Results for Non-Preemptive Speed Scaling
