Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models

DOI10.1016/j.tcs.2022.10.005OpenAlexW4304943020MaRDI QIDQ2089685

Ruilong Zhang, Shanjiawen Zhao, Benjamin Moselely

Publication date: 24 October 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.10.005

zbMATH Keywords

schedulingcompetitive analysisonline algorithms\( \ell_k\)-norm of flow timeDAG jobsparallelizable jobs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Scheduling parallel tasks with sequential heads and tails
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• Scheduling parallelizable jobs online to maximize throughput
• Online scheduling of moldable parallel tasks
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Minimizing Maximum Flowtime of Jobs with Arbitrary Parallelizability
• Scalably scheduling processes with arbitrary speedup curves
• Complexity of Scheduling Parallel Task Systems
• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Precedence-Constrained Scheduling of Malleable Jobs with Preemption
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• Approximation Algorithms for Scheduling Parallel Jobs

This page was built for publication: Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models