Journal of information and communication convergence engineering

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

Approximation Algorithms for Scheduling Parallel Jobs with More Machines

  • Kim, Jae-Hoon (Division of Computer Engineering, Pusan University of Foreign Studies)
  • Received : 2011.06.16
  • Accepted : 2011.07.29
  • Published : 2011.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

In parallel job scheduling, each job can be executed simultaneously on multiple machines at a time. Thus in the input instance, a job $J_i$ requires the number $m_i$ of machines on which it shall be processed. The algorithm should determine not only the execution order of jobs but also the machines on which the jobs are executed. In this paper, when the jobs have deadlines, the problem is to maximize the total work of jobs which is completed by their deadlines. The problem is known to be strongly NP-hard [5] and we investigate the approximation algorithms for the problem. We consider a model in which the algorithm can have more machines than the adversary. With this advantage, the problem is how good solution the algorithm can produce against the optimal algorithm.

Keywords

References

  1. J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt and J. Weglarz, Handbook on Scheduling: From Theory to Applications. Springer, Heidelberg, 2007.
  2. M. Drozdowski, "Scheduling multiprocessor tasks - an overview", European Journal of Operational Research, vol. 94(2), pp. 215-230, 1996. https://doi.org/10.1016/0377-2217(96)00123-3
  3. J. Y. Leung, Handbook of Scheduling: Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC, 2004.
  4. A. V. Fishkin and G. Zhang, "On maximizing the throughput of multi-processor tasks", Theoretical Computer Science, vol. 302, pp. 319-335, 2003. https://doi.org/10.1016/S0304-3975(02)00850-2
  5. J. Du and J. Y. Leung, "Complexity of scheduling parallel task systems", SIAM J. Disc. Math., vol. 2(4), pp. 473-487, 1989. https://doi.org/10.1137/0402042
  6. B. Johannes, "Scheduling parallel jobs to minimize the makespan", Journal of Scheduling, vol. 9(5), pp. 433-452, 2006. https://doi.org/10.1007/s10951-006-8497-6
  7. M. R. Garey and R. L. Graham, "Complexity results for multiprocessor scheduling under resource constraints", SIAM Journal on Computing, vol. 4(4), pp. 397-411, 1975. https://doi.org/10.1137/0204035
  8. A. K. Amoura, E. Bampis, C. Kenyon, and Y. Manoussakis, "Scheduling independent multiprocessor tasks", Algorithmica, vol. 32(2), pp. 247-261, 2007.
  9. K. Jansen and L. Porkolab, "Linear-time approximation schemes for scheduling malleable parallel tasks", Algorithmica, vol. 32(3), pp. 507-520, 2002. https://doi.org/10.1007/s00453-001-0085-8
  10. I. Schiermeyer, "Reverse-fit: A 2-optimal algorithm for rectangle packing", Proc. 2th Annual European Symposium on Algorithms, pp. 290-299, 1994.
  11. A. Steinberg, "A strip-packing algorithm with absolute performance bound 2", SIAM Journal on Computing, vol. 26(2), pp. 401-409, 1997. https://doi.org/10.1137/S0097539793255801
  12. U. Schwiegelshohn, W. Ludwig, J. L. Wolf, J. J. Turek, and P. S. Yu, "Smart SMART bounds for weighted reponse time scheduling", SIAM Journal on Computing, vol. 28(1), pp. 237-253, 1998. https://doi.org/10.1137/S0097539795286831
  13. Oh-Heum Kwon and Kyung-Yong Chwa, "Scheduling parallel tasks with individual deadlines", Theoretical Computer Science, vol. 215(1-2), pp. 209-223, 1999. https://doi.org/10.1016/S0304-3975(97)00178-3

Cited by

  1. 가단성 태스크들의 마감시간 스케줄링의 자원추가 분석 vol.16, pp.10, 2011, https://doi.org/10.6109/jkiice.2012.16.10.2303