An effective approximation algorithm for the malleable parallel task scheduling problem
DOI10.1016/J.JPDC.2012.01.011zbMATH Open1242.68035OpenAlexW2042999105MaRDI QIDQ433456FDOQ433456
Authors: Liya Fan, Fa Zhang, Gongming Wang, Zhi-Yong Liu 
Publication date: 13 July 2012
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jpdc.2012.01.011
Recommendations
- scientific article; zbMATH DE number 1003247
- Scheduling malleable tasks on parallel processors to minimize the makespan
- scientific article; zbMATH DE number 1863269
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- An approximation algorithm for scheduling trees of malleable tasks
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Parallel algorithms in computer science (68W10)
Cites Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A near-optimal solution to a two-dimensional cutting stock problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A Strip-Packing Algorithm with Absolute Performance Bound 2
- Title not available (Why is that?)
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Scheduling malleable tasks on parallel processors to minimize the makespan
- Two-dimensional packing problems: a survey
- Scheduling Multiprocessor Tasks to Minimize Schedule Length
- Orthogonal Packings in Two Dimensions
- Linear-Time approximation schemes for scheduling malleable parallel tasks
- Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
- Project Scheduling with Continuously-Divisible, Doubly Constrained Resources
- A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
- A 2.5 times optimal algorithm for packing in two dimensions
- Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2
- Bounds for Multiprocessor Scheduling with Resource Constraints
- Dynamic scheduling on parallel machines
- Computing optimal preemptive schedules for parallel tasks: linear programming approaches
- Competitive online scheduling of perfectly malleable jobs with setup times
- A Heuristic of Scheduling Parallel Tasks and Its Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scheduling independent multiprocessor tasks
- List scheduling of parallel tasks
Cited In (2)
This page was built for publication: An effective approximation algorithm for the malleable parallel task scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433456)
