Throughput Maximization for Speed-Scaling with Agreeable Deadlines

DOI10.1007/978-3-642-38236-9_2zbMath1382.68040OpenAlexW156670816MaRDI QIDQ4922109

Vincent Chau, Dimitrios Letsios, Eric Angel, Evripidis Bampis

Publication date: 28 May 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38236-9_2

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Throughput maximization in multiprocessor speed-scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs

This page was built for publication: Throughput Maximization for Speed-Scaling with Agreeable Deadlines