Scheduling precedence graphs in systems with interprocessor communication times
SIAM Journal on Computing
Complexity of scheduling parallel task systems
SIAM Journal on Discrete Mathematics
Generalised multiprocessor scheduling using optimal control
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Approximate algorithms scheduling parallelizable tasks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
LogP: a practical model of parallel computation
Communications of the ACM
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem
Mathematics of Operations Research
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
Linear-time approximation schemes for scheduling malleable parallel tasks
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
List scheduling of general task graphs under LogP
Parallel Computing - Special issue on new trends on scheduling in parallel and distributed systems
Parallel Computer Architecture: A Hardware/Software Approach
Parallel Computer Architecture: A Hardware/Software Approach
Dynamic Load Balancing for Ocean Circulation Model with Adaptive Meshing
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial-Time Approximation Scheme
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Scheduling malleable tasks with precedence constraints
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Tightness results for malleable task scheduling algorithms
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
| Hi-index | 0.00 |
In this paper we study the problem of scheduling malleable tasks with precedence constraints. We are given m identical processors and n tasks. For each task the processing time is a function of the number of processors allotted to it. In addition, the tasks must be processed according to the precedence constraints. The goal is to minimize the makespan (maximum completion time) of the resulting schedule. The best previous approximation algorithm (that works in two phases) by Lepére et al. [18] has a ratio $3 + \sqrt{5} \approx 5.236$. We develop an improved approximation algorithm with a ratio at most $100/43 + 100(\sqrt{4349} - 7)/2451 \approx 4.730598$. We also show that our resulting ratio is asymptotically tight.