Preemptive weighted completion time scheduling of parallel jobs
In this paper we present a new algorithm for the off-line scheduling of parallel and independent jobs on a massively parallel processor system. We also introduce a machine model which is based on existing multiprocessors and accounts for the penalty of preemption. It is shown that the new algorithm achieves a small approximation factor for both weighted completion time and makespan scheduling. To fine tune the algorithm a fairly simple numerical optimization problem is derived. This way different preemption penalties can be considered when determining the approximation factor. Finally, we compare the generated schedule with non-preemptive schedules for the same problem.
KeywordsExecution Time Completion Time Approximation Factor Preemptive Schedule Total Weighted Completion Time
Unable to display preview. Download preview PDF.
- 1.X. Deng, N. Gu, T. Brecht, and K. Lu. Preemptive scheduling of parallel jobs on multiprocessors. In Proceedings of the 7 th SIAM Symposium on Discrete Algorithms, January 1996.Google Scholar
- 2.D.G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, pages 1–18. Springer-Verlag, Lecture Notes in Computer Science, 1995.Google Scholar
- 4.M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.Google Scholar
- 6.R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6(1):1–12, October 1959.Google Scholar
- 7.U. Schwiegeishohn, W. Ludwig, J. Wolf, J. Turek, and P. Yu. Smart SMART bounds for weighted response time scheduling. Technical Report RC 19789 (87176), IBM Research Division, July 1994. also to be published in SIAM Journal on Computing.Google Scholar
- 8.U. Schwiegelshohn, J. Turek, and J. Wolf. Preemptive scheduling of parallel tasks. Technical Report RC 20104 (88932), IBM Research Division, June 1995.Google Scholar
- 9.W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.Google Scholar
- 10.J. Turek, W. Ludwig, J. Wolf, L. Fleischer, P. Tiwari, J. Glasgow, U. Schwiegelshohn, and P. Yu. Scheduling parallelizable tasks to minimize average response time. In Proceedings of the 6th Annual Symposium on Parallel Algorithms and Architectures, Cape May, NJ, pages 200–209, June 1994.Google Scholar
- 11.J. Turek, U. Schwiegelshohn, J. Wolf, and P. Yu. Scheduling parallel tasks to minimize average response times. In Proceedings of the 5 th SIAM Symposium on Discrete Algorithms, pages 112–121, January 1994.Google Scholar