General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time
- 558 Downloads
We study the problem of scheduling a set of n independent tasks on a fixed number of parallel processors, where the execution time of a task is a function of the subset of processors assigned to the task. We propose a fully polynomial approximation scheme that for any fixed ∈ > 0 finds a preemptive schedule of length at most (1 + ∈) times the optimum in O(n) time.We also discuss the non-preemptive variant of the problem, and present a polynomial approximation scheme that computes an approximate solution of any fixed accuracy in linear time. In terms of the running time, this linear complexity bound gives a substantial improvement of the best previously known polynomial bound .
KeywordsTotal Execution Time Total Processing Time Polynomial Time Approximation Scheme Preemptive Schedule Small Task
Unable to display preview. Download preview PDF.
- 1.A. K. Amoura, E. Bampis, C. Kenyon and Y. Manoussakis, Scheduling independent multiprocessor tasks, Proceedings of the 5th Annual European Symposium on Algorithms (1997), LNCS 1284, 1–12.Google Scholar
- 4.J. Chen and C.-Y. Lee, General multiprocessor tasks scheduling, Naval Research Logistics, in press.Google Scholar
- 5.J. Chen and A. Miranda, A polynomial time approximation scheme for general multiprocessor job scheduling, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 418–427.Google Scholar
- 10.K. Jansen and L. Porkolab, Linear-time approximation schemes for scheduling malleable parallel tasks, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (1999), 490–498.Google Scholar
- 11.K. Jansen and L. Porkolab, Improved approximation schemes for scheduling unrelated parallel machines, Proceedings of the 31st Annual ACM Symposium on the Theory of Computing (1999), 408–417.Google Scholar