An approximation algorithm for scheduling malleable tasks under general precedence constraints
From MaRDI portal
Publication:2944524
DOI10.1145/1159892.1159899zbMath1321.68121MaRDI QIDQ2944524
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
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Unnamed Item, Malleable scheduling beyond identical machines, Scheduling malleable tasks with precedence constraints, Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models, Dynamic resource allocation for efficient parallel CFD simulations, Malleable scheduling for flows of jobs and applications to MapReduce, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width