A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks

DOI10.1016/j.tcs.2006.05.012zbMath1097.68148OpenAlexW2155766658MaRDI QIDQ2503351

Burkhard Monien, Thomas Lücking, Thomas Decker

Publication date: 14 September 2006

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

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

zbMATH Keywords

schedulingapproximation algorithmsmalleable jobs

Mathematics Subject Classification ID

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

Related Items (2)

Efficient approximation algorithms for scheduling moldable tasks ⋮ Online scheduling of moldable parallel tasks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiprocessor scheduling with communication delays
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• An approximation scheme for strip packing of rectangles with bounded dimensions
• A typology of cutting and packing problems
• Complexity of Scheduling Parallel Task Systems
• Orthogonal Packings in Two Dimensions
• A algorithm for two-dimensional packing
• Bounds for Multiprocessor Scheduling with Resource Constraints
• A Strip-Packing Algorithm with Absolute Performance Bound 2

This page was built for publication: A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks