Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme

DOI10.1007/3-540-45749-6_50MaRDI QIDQ4411391zbMATH OpenFDO

Authors Klaus Jansen

Publication date 8 July 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/2461/24610562.htm

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1305441
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• scientific article; zbMATH DE number 1241387
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• A \frac32‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks

Cited in

(11)

• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
• Scheduling trees of malleable tasks for sparse linear algebra
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
• scientific article; zbMATH DE number 1241387 (Why is no real title available?)
• scientific article; zbMATH DE number 1305441 (Why is no real title available?)
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Scheduling parallel tasks with individual deadlines

This page was built for publication: Scheduling malleable parallel tasks: An asymptotic fully polynomial-time approximation scheme

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