Linear-Time approximation schemes for scheduling malleable parallel tasks

DOI10.1007/S00453-001-0085-8MaRDI QIDQ1348949zbMATH OpenOpenAlexFDO

Authors Klaus Jansen, Lorant Porkolab

Publication date 21 May 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11858/00-001M-0000-0014-7B6C-D

zbMATH Keywords

schedulingmalleable tasks

Mathematics Subject Classification ID

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

Cited in

(29)

• Algorithms for scheduling deadline-sensitive malleable tasks
• Approximation algorithms for scheduling monotonic moldable tasks on multiple platforms
• Grouping techniques for scheduling problems: simpler and faster
• Scheduling malleable tasks with precedence constraints
• scientific article; zbMATH DE number 7650084 (Why is no real title available?)
• General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• scientific article; zbMATH DE number 1863269 (Why is no real title available?)
• Scheduling malleable tasks on parallel processors to minimize the makespan
• Scheduling parallel tasks with individual deadlines
• A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds
• An effective approximation algorithm for the malleable parallel task scheduling problem
• scientific article; zbMATH DE number 2080263 (Why is no real title available?)
• Resource loading with time windows
• An approximation algorithm for scheduling trees of malleable tasks
• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• An improved approximation algorithm for scheduling monotonic moldable tasks
• Malleable scheduling beyond identical machines
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
• Approximate strong separation with application in fractional graph coloring and preemptive scheduling.
• Online scheduling of moldable parallel tasks
• A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
• Competitive online scheduling of perfectly malleable jobs with setup times
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• Approximation and Online Algorithms
• Scheduling trees of malleable tasks for sparse linear algebra
• scientific article; zbMATH DE number 1947422 (Why is no real title available?)
• Efficient approximation algorithms for scheduling moldable tasks
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width

This page was built for publication: Linear-Time approximation schemes for scheduling malleable parallel tasks

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