On speed scaling scheduling of parallel jobs with preemption

DOI10.1007/978-3-319-44914-2_25MaRDI QIDQ3133224zbMATH OpenOpenAlexFDO

Authors 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

approximation algorithmschedulingspeed scalingNP-hardnessparallel 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)

Recommendations

• Approximation algorithms for energy-efficient scheduling of parallel jobs
• Speed scaling on parallel processors with migration
• Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
• Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
• Speed-scaling with no preemptions

Cited in

(4)

• 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
• Approximation and Online Algorithms

This page was built for publication: On speed scaling scheduling of parallel jobs with preemption

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