Scheduling malleable tasks with precedence constraints
From MaRDI portal
Publication:414874
DOI10.1016/j.jcss.2011.04.003zbMath1238.68041OpenAlexW1964122413MaRDI QIDQ414874
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items
Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines ⋮ Approximation schemes for packing problems with \(\ell_p\)-norm diversity constraints ⋮ Scheduling malleable tasks with precedence constraints ⋮ Handling precedence constraints in scheduling problems by the sequence pair representation ⋮ Malleable scheduling for flows of jobs and applications to MapReduce
Cites Work
- Scheduling malleable tasks with precedence constraints
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- List scheduling of general task graphs under LogP
- An approximation algorithm for scheduling trees of malleable tasks
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- The optimal control approach to generalized multiprocessor scheduling
- Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
- 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
- Scheduling Precedence Graphs in Systems with Interprocessor Communication Times
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Complexity of Scheduling under Precedence Constraints
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- Bounds for Certain Multiprocessing Anomalies
