Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
M. Garey and R. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4(2):187–200, June 1975.
M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979.
T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4):1119–1129, November 1986.
R. McNaughton. Scheduling with deadlines and loss functions. Management Science, 6(1):1–12, October 1959.
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.
U. Schwiegelshohn, J. Turek, and J. Wolf. Preemptive scheduling of parallel tasks. Technical Report RC 20104 (88932), IBM Research Division, June 1995.
W. Smith. Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3:59–66, 1956.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schwiegeishohn, U. (1996). Preemptive weighted completion time scheduling of parallel jobs. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_45
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive