Speed scaling of tasks with precedence constraints

DOI10.1007/s00224-007-9070-1zbMath1140.68010OpenAlexW2085836112MaRDI QIDQ927406

Patchrawat Uthaisombut, Rob van Stee, Kirk R. Pruhs

Publication date: 6 June 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9070-1

zbMATH Keywords

makespanmultiprocessor

Mathematics Subject Classification ID

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

Related Items (11)

A survey of offline algorithms for energy minimization under deadline constraints ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Energy-efficient bi-objective single-machine scheduling with power-down mechanism ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ Improved multi-processor scheduling for flow time and energy ⋮ Speed scaling on parallel processors ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget ⋮ Resource cost aware scheduling ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling ⋮ Speed scaling for maximum lateness

Cites Work

• Unnamed Item
• Approximation schemes for scheduling on parallel machines
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• Speed scaling to manage energy and temperature
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Approximation Algorithms for Precedence-Constrained Scheduling Problems on Parallel Machines that Run at Different Speeds
• Algorithm Theory - SWAT 2004
• Algorithms and Data Structures
• Bounds for Certain Multiprocessing Anomalies
• STACS 2005
• Computing and Combinatorics

This page was built for publication: Speed scaling of tasks with precedence constraints