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
On the hardness of approximating minimization problems
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Improved non-approximability results
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling unrelated machines with costs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scheduling malleable and nonmalleable parallel tasks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
Journal of the ACM (JACM)
| Hi-index | 0.89 |
A general parallel task scheduling problem is considered. A task can be processed in parallel on one of several alternative subsets of processors. The processing time of the task depends on the subset of processors assigned to the task. We first show the hardness of approximating the problem for both preemptive and nonpreemptive cases in the general setting. Next we focus on linear array network of m processors. We give an approximation algorithm of ratio O(log m) for nonpreemptive scheduling, and another algorithm of ratio 2 for preemptive scheduling. Finally, we give a nonpreemptive scheduling algorithm of ratio O(log2 m) for m × m two-dimensional meshes.