Scheduling malleable tasks with precedence constraints

DOI10.1016/J.JCSS.2011.04.003zbMATH Open1238.68041OpenAlexW1964122413MaRDI QIDQ414874FDOQ414874

Authors Klaus Jansen, Hu Zhang

Publication date 11 May 2012

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jcss.2011.04.003

zbMATH Keywords

approximation algorithmschedulingmalleable tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Recommendations

• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Algorithms and Computation
• scientific article; zbMATH DE number 1875414
• scientific article; zbMATH DE number 1003247
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS

Cites work

• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• An approximation algorithm for scheduling trees of malleable tasks
• Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
• Approximation algorithms for the discrete time-cost tradeoff problem
• Bounds for Certain Multiprocessing Anomalies
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Complexity of Scheduling Parallel Task Systems
• Complexity of Scheduling under Precedence Constraints
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• List scheduling of general task graphs under LogP
• Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
• Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
• Scheduling malleable tasks with precedence constraints
• The optimal control approach to generalized multiprocessor scheduling

Cited in

(13)

• Algorithms and Computation
• Malleable scheduling for flows of jobs and applications to MapReduce
• Scheduling malleable tasks with precedence constraints
• Precedence-constrained scheduling of malleable jobs with preemption
• APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
• scientific article; zbMATH DE number 1003247 (Why is no real title available?)
• scientific article; zbMATH DE number 1875414 (Why is no real title available?)
• Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
• Preemptive scheduling with variable profile, precedence constraints and due dates
• Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
• Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
• Handling precedence constraints in scheduling problems by the sequence pair representation

This page was built for publication: Scheduling malleable tasks with precedence constraints

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