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

DOI10.1016/J.TCS.2022.10.005MaRDI QIDQ2089685zbMATH OpenOpenAlexFDO

Authors Benjamin Moselely, Ruilong Zhang, Shanjiawen Zhao

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

\( \ell_k\)-norm of flow timecompetitive analysisDAG jobsonline algorithmsparallelizable jobsscheduling

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Scheduling parallel jobs online with convex and concave parallelizability
• Scheduling parallel jobs online with convex and concave parallelizability
• Scheduling parallelizable jobs online to maximize throughput
• Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work

Cites work

• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Approximation algorithms for scheduling parallel jobs
• Complexity of Scheduling Parallel Task Systems
• Minimizing maximum flowtime of jobs with arbitrary parallelizability
• Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work
• Online scheduling of moldable parallel tasks
• Precedence-constrained scheduling of malleable jobs with preemption
• Scalably scheduling processes with arbitrary speedup curves
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Scheduling parallel tasks with sequential heads and tails
• Scheduling parallelizable jobs online to maximize throughput

Cited in

(2)

• Scheduling Parallel DAG Jobs Online to Minimize Average Flow Time
• Maximizing throughput for parallel jobs with speed-up curves

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

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