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
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Bounds for Certain Multiprocessing Anomalies
- Complexity of Scheduling under Precedence Constraints
- Approximation algorithms for the discrete time-cost tradeoff problem
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- List scheduling of general task graphs under LogP
- An approximation algorithm for scheduling trees of malleable tasks
- The optimal control approach to generalized multiprocessor scheduling
- An approximation algorithm for scheduling malleable tasks under general precedence constraints
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
- Complexity of Scheduling Parallel Task Systems
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Scheduling malleable tasks with precedence constraints
Cited In (11)
- Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
- Scheduling malleable tasks with precedence constraints
- Title not available (Why is that?)
- Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width
- Algorithms and Computation
- APPROXIMATION ALGORITHMS FOR SCHEDULING MALLEABLE TASKS UNDER PRECEDENCE CONSTRAINTS
- Preemptive scheduling with variable profile, precedence constraints and due dates
- Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints
- Handling precedence constraints in scheduling problems by the sequence pair representation
- Malleable scheduling for flows of jobs and applications to MapReduce
- Title not available (Why is that?)
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)
