On Speed Scaling Scheduling of Parallel Jobs with Preemption

DOI10.1007/978-3-319-44914-2_25zbMath1380.68077OpenAlexW2557801110MaRDI QIDQ3133224

Alexander Kononov, Julia Viktorovna Kovalenko

Publication date: 13 February 2018

Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44914-2_25

zbMATH Keywords

schedulingapproximation algorithmNP-hardnessspeed scalingparallel jobs

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs

This page was built for publication: On Speed Scaling Scheduling of Parallel Jobs with Preemption