Tradeoff between Energy and Throughput for Online Deadline Scheduling

DOI10.1007/978-3-642-18318-8_6zbMath1314.68405OpenAlexW1519739914WikidataQ58062935 ScholiaQ58062935MaRDI QIDQ3075449

Ho-Leung Chan, Rongbin Li, Tak-Wah Lam

Publication date: 15 February 2011

Published in: Approximation and Online Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18318-8_6

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Throughput maximization in multiprocessor speed-scaling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Throughput maximization for speed scaling with agreeable deadlines ⋮ Energy-aware scheduling mandatory/optional tasks in multicore real-time systems ⋮ Energy efficient scheduling of parallelizable jobs

This page was built for publication: Tradeoff between Energy and Throughput for Online Deadline Scheduling