From Preemptive to Non-preemptive Speed-Scaling Scheduling

DOI10.1007/978-3-642-38768-5_14zbMath1381.68021OpenAlexW1735147695MaRDI QIDQ4925232

Dimitrios Letsios, Alexander V. Kononov, Ioannis Nemparis, Giorgio Lucarelli, Evripidis Bampis

Publication date: 11 June 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-38768-5_14

Mathematics Subject Classification ID

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

Related Items

Throughput maximization in multiprocessor speed-scaling ⋮ Energy-Efficient Algorithms for Non-preemptive Speed-Scaling ⋮ An Exact Algorithm for Non-preemptive Peak Demand Job Scheduling ⋮ Throughput Maximization in Multiprocessor Speed-Scaling ⋮ Non-preemptive speed scaling ⋮ A fully polynomial-time approximation scheme for speed scaling with a sleep state

Cites Work

• Unnamed Item
• Unnamed Item
• Speed scaling on parallel processors
• Speed scaling of tasks with precedence constraints
• On multi-processor speed scaling with migration
• The bell is ringing in speed-scaled multiprocessor scheduling
• Non-preemptive Speed Scaling
• Speed Scaling for Maximum Lateness
• Speed Scaling on Parallel Processors with Migration
• Green Scheduling, Flows and Matchings
• An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules