Approximation and Online Algorithms

DOI10.1007/11671411MaRDI QIDQ5898482zbMATH OpenOpenAlexFDO

Authors Rob van Stee, Patchrawat Uthaisombut, Kirk Pruhs

Publication date 12 February 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11671411

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• Speed scaling of tasks with precedence constraints
• Speed-scaling with no preemptions
• Energy-efficient algorithms for non-preemptive speed-scaling
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
• Speed scaling on parallel processors

Cited in

(8)

• Multiprocessor speed scaling for jobs with arbitrary sizes and deadlines
• Scheduling algorithms for procrastinators
• Non-preemptive Speed Scaling
• Speed scaling of tasks with precedence constraints
• Power-aware scheduling for makespan and flow
• The Effect of Time Constraints on Scaled Speedup
• Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan
• Power and performance management for parallel computations in clouds and data centers

This page was built for publication: Approximation and Online Algorithms

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