Non-preemptive Speed Scaling
From MaRDI portal
Publication:2904561
DOI10.1007/978-3-642-31155-0_22zbMath1357.68017OpenAlexW289957573MaRDI QIDQ2904561
Chien-Chung Huang, Antonios Foivos Antoniadis
Publication date: 14 August 2012
Published in: Algorithm Theory – SWAT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31155-0_22
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (5)
Energy-efficient scheduling and routing via randomized rounding ⋮ An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling ⋮ Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
This page was built for publication: Non-preemptive Speed Scaling
