Optimizing throughput and energy in online deadline scheduling

DOI10.1145/1644015.1644025zbMath1300.90013OpenAlexW2102094940WikidataQ58062957 ScholiaQ58062957MaRDI QIDQ2930284

Prudence W. H. Wong, Kin-Sum Mak, Joseph Wun-Tat Chan, Ho-Leung Chan, Lap-Kei Lee, Tak-Wah Lam, Kin-Sum Mak

Publication date: 18 November 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1644015.1644025

zbMATH Keywords

competitive analysisonline algorithmsspeed scalingpower savingdeadline scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (11)

Energy-efficient deadline scheduling for heterogeneous systems ⋮ Speed scaling on parallel processors with migration ⋮ Unnamed Item ⋮ Speed scaling on parallel processors ⋮ Station assignment with reallocation ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Multiprocessor Speed Scaling for Jobs with Arbitrary Sizes and Deadlines ⋮ Continuous speed scaling with variability: a simple and direct approach ⋮ Deadline scheduling and power management for speed bounded processors ⋮ Race to idle ⋮ On multi-processor speed scaling with migration

This page was built for publication: Optimizing throughput and energy in online deadline scheduling