Scheduling parallel jobs online with convex and concave parallelizability

DOI10.1007/s00224-016-9722-0zbMath1390.90311OpenAlexW2552157853MaRDI QIDQ1743115

Samuel McCauley, Benjamin Moseley, Roozbeh Ebrahimi

Publication date: 12 April 2018

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

Full work available at URL: https://doi.org/10.1007/s00224-016-9722-0

zbMATH Keywords

competitive analysisonline schedulingconvex and concave parallelizability

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Efficient approximation algorithms for scheduling moldable tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Energy efficient scheduling of parallelizable jobs
• The optimal control approach to generalized multiprocessor scheduling
• Approximating total flow time on parallel machines
• Scalably scheduling processes with arbitrary speedup curves
• Better Scalable Algorithms for Broadcast Scheduling
• Speed is as powerful as clairvoyance
• A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
• Scheduling in the dark

This page was built for publication: Scheduling parallel jobs online with convex and concave parallelizability