Scheduling Multiprocessor Tasks to Minimize Schedule Length
IEEE Transactions on Computers
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast approximation algorithms for fractional packing and covering problems
Mathematics of Operations Research
A Strip-Packing Algorithm with Absolute Performance Bound 2
SIAM Journal on Computing
Efficient approximation algorithms for scheduling malleable tasks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem
Mathematics of Operations Research
Approximate Max-Min Resource Sharing for Structured Concave Optimization
SIAM Journal on Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Preemptive Parallel Task Scheduling in O(n)+Poly(m) Time
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
An efficient approximation scheme for the one-dimensional bin-packing problem
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Combinatorial Optimization: Theory and Algorithms
Combinatorial Optimization: Theory and Algorithms
Theoretical Computer Science
Scheduling malleable tasks with precedence constraints
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
A 5/4-approximation algorithm for scheduling identical malleable tasks
Theoretical Computer Science - Approximation and online algorithms
Two level job-scheduling strategies for a computational grid
PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
An approximation algorithm for scheduling malleable tasks under general precedence constraints
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
| Hi-index | 0.00 |
A malleable parallel task is one whose execution time is a function of the number of (identical) processors allotted to it. We study the problem of scheduling a set of n independent malleable tasks on an arbitrary number m of parallel processors and propose an asymptotic fully polynomial time approximation scheme. For any fixed 驴 0, the algorithm computes a non-preemptive schedule of length at most (1 + 驴) times the optimum (plus an additive term) and has running time polynomial in n, m and 1/驴.