Algorithm Theory - SWAT 2004
From MaRDI portal
Publication:5315386
DOI10.1007/b98413zbMath1095.68553OpenAlexW2615963353MaRDI QIDQ5315386
Gerhard J. Woeginger, Patchrawat Uthaisombut, Kirk R. Pruhs
Publication date: 7 September 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b98413
Convex programming (90C25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ Efficient computation of optimal energy and fractional weighted flow trade-off schedules ⋮ Optimal Speed Scaling with a Solar Cell ⋮ Min-energy scheduling for aligned jobs in accelerate model ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Nonclairvoyant speed scaling for flow and energy ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules ⋮ Speed scaling of tasks with precedence constraints ⋮ Speed scaling of processes with arbitrary speedup curves on a multiprocessor ⋮ Power-aware scheduling for makespan and flow ⋮ Green scheduling, flows and matchings
This page was built for publication: Algorithm Theory - SWAT 2004