An approximation algorithm for scheduling malleable tasks under general precedence constraints

DOI10.1145/1159892.1159899zbMath1321.68121OpenAlexW1967030015MaRDI QIDQ2944524

Hu Zhang, Klaus Jansen

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1159892.1159899

zbMATH Keywords

schedulingprecedence constraintsapproximation algorithmsmalleable tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Related Items (7)

Dynamic resource allocation for efficient parallel CFD simulations ⋮ Malleable scheduling beyond identical machines ⋮ Scheduling malleable tasks with precedence constraints ⋮ Unnamed Item ⋮ Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width ⋮ Malleable scheduling for flows of jobs and applications to MapReduce ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models

This page was built for publication: An approximation algorithm for scheduling malleable tasks under general precedence constraints