Abstract
We study an on-line parallel job scheduling problem, where jobs arrive one by one. A parallel job may require a number of machines for its processing at the same time. Upon arrival of a job, its processing time and the number of requested machines become known, and it must be scheduled immediately without any knowledge of future jobs. We present a 7-competitive on-line algorithm, which improves the previous upper bound of 12 by Johannes (J. Sched. 9:433–452, 2006). Furthermore, we investigate a special case in which the largest processing time is known beforehand.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baker, B. S., Coffman, E., & Rivest, R. (1980). Orthogonal packings in two dimensions. SIAM Journal on Computing, 9, 846–855.
Baker, B. S., & Schwarz, J. S. (1983). Shelf algorithm for two-dimensional packing problems. SIAM Journal on Computing, 12, 508–525.
Bischof, S., & Mayr, E. W. (2001). On-line scheduling of parallel jobs with runtime restrictions. Theoretical Computer Science, 268, 67–90.
Blazewicz, J., Cellary, W., Slowinski, R., & Weglarz, J. (1986). Scheduling under resource constraints—deterministic models. Annals of Operations Research, 7, 1–359.
Brown, D. J., Baker, B. S., & Katseff, H. P. (1982). Lower bounds for on-line two-dimensional packing algorithms. Acta Informatica, 18, 207–225.
Csirik, J., & Woeginger, G. (1998). On-line packing and covering problems. In Lecture notes in computer science : Vol. 1442. Online algorithms—the state of art (pp. 147–195). Berlin: Springer.
Coffman, E., Garey, M., Johnson, D. S., & Tarjan, R. (1980). Performance bounds for level-oriented two-dimensional packing problems. SIAM Journal on Computing, 9, 808–826.
Drozdowski, M. (1996). Scheduling multiprocessor tasks—an overview. European Journal on Operations Research, 94, 215–230.
Du, J., & Leung, J. (1989). Complexity of scheduling parallel task system. SIAM Journal on Discrete Mathematics, 2, 473–487.
Feldmann, A., Kao, M.-Y., Sgall, J., & Teng, S.-H. (1998). Optimal online scheduling of parallel jobs with dependencies. Journal of Combinatorial Optimization, 1, 393–411.
Garey, M., & Johnson, D. S. (1975). Complexity results for multiprocessor scheduling under resource constraints. SIAM Journal on Computing, 4, 397–411.
Johannes, B. (2006). Scheduling parallel jobs to minimize makespan. Journal of Scheduling, 9, 433–452.
Kenyon, C., & Remila, E. (1996). Approximate strip packing. In Proceedings of the 37th IEEE symposium on foundations of computer science (FOCS) (pp. 31–36).
Ludwig, W., & Tiwari, P. (1994). Scheduling malleable and nonmalleable parallel tasks. In Proceedings of the 5th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 167–176).
Naroska, E., & Schwiegelshohn, U. (2002). On an on-line scheduling problem for parallel jobs. Information Processing Letters, 81, 297–304.
Steinberg, A. (1997). A strip packing algorithm with absolute performance bound 2. SIAM Journal on Computing, 26, 401– 409.
Author information
Authors and Affiliations
Corresponding author
Additional information
A preliminary version of this paper appeared in Proceedings of the 11th Colloquium on Structural Information and Communication Complexity (SIROCCO’04, pp. 279-290).
Research of D. Ye was supported by NSFC (10601048).
Research of G. Zhang was supported by NSFC (60573020).
Rights and permissions
About this article
Cite this article
Ye, D., Zhang, G. On-line scheduling of parallel jobs in a list. J Sched 10, 407–413 (2007). https://doi.org/10.1007/s10951-007-0032-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10951-007-0032-x