Non-preemptive Speed Scaling

DOI10.1007/978-3-642-31155-0_22MaRDI QIDQ2904561zbMATH OpenOpenAlexFDO

Authors Antonios Foivos Antoniadis, Chien-Chung Huang

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

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Non-preemptive speed scaling
• Speed-scaling with no preemptions
• New Results for Non-Preemptive Speed Scaling
• From preemptive to non-preemptive speed-scaling scheduling
• From preemptive to non-preemptive speed-scaling scheduling
• Energy-efficient algorithms for non-preemptive speed-scaling
• Non-preemptive throughput maximization for speed-scaling with power-down
• Speed scaling on parallel processors
• Approximation and Online Algorithms
• Speed scaling of tasks with precedence constraints

Cited in

(11)

• Energy-efficient scheduling and routing via randomized rounding
• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Speed scaling problems with memory/cache consideration
• New Results for Non-Preemptive Speed Scaling
• An exact algorithm for non-preemptive peak demand job scheduling
• Speed-scaling with no preemptions
• Energy-efficient algorithms for non-preemptive speed-scaling
• Non-preemptive speed scaling
• From preemptive to non-preemptive speed-scaling scheduling
• From preemptive to non-preemptive speed-scaling scheduling
• Algorithms and Data Structures

This page was built for publication: Non-preemptive Speed Scaling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904561)