Approximation algorithms for scheduling malleable tasks under precedence constraints

DOI10.1007/3-540-44676-1_12MaRDI QIDQ4796173zbMATH OpenFDO

Authors Renaud Lepère, Gerhard J. Woeginger, Denis Trystram

Publication date 2 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2161/21610146, https://ris.utwente.nl/ws/files/25249398/Lepere2001approximation.pdf

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• Algorithms and Computation
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Scheduling malleable tasks with precedence constraints
• An approximation algorithm for scheduling trees of malleable tasks

Cited in

(17)

• An approximation algorithm for scheduling trees of malleable tasks
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
• Malleable scheduling for flows of jobs and applications to MapReduce
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• Approximate Deadline-Scheduling with Precedence Constraints
• Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
• Scheduling malleable tasks with precedence constraints
• Parallel scheduling problems in next generation wireless networks
• scientific article; zbMATH DE number 2086932 (Why is no real title available?)
• Precedence-constrained scheduling of malleable jobs with preemption
• scientific article; zbMATH DE number 5260973 (Why is no real title available?)
• Algorithms and Computation
• Strip packing with precedence constraints and strip packing with release times
• A monotone approximation algorithm for scheduling with precedence constraints

This page was built for publication: Approximation algorithms for scheduling malleable tasks under precedence constraints

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