Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

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

DOI QR Code

Online Deadline Scheduling of Equal Length Jobs with More Machines

추가 머신들을 이용한 동일 길이 작업들의 온라인 마감시간 스케줄링

  • Kim, Jae-Hoon (Department of Computer Engineering, Busan University of Foreign Studies)
  • Received : 2013.04.29
  • Accepted : 2013.07.25
  • Published : 2013.08.31
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider the online scheduling problem of jobs with deadlines. The jobs arrive over time and the scheduling algorithm has no information about the arriving jobs in advance. The jobs have the processing time of the equal length and the goal of the scheduling algorithm is to maximize the number of jobs completed in their deadlines. The performance of the online algorithm is compared with that of the optimal algorithm which has the full information about all the jobs. The raio of the two performances is called the competitive ratio. In general, the ratio is unbouned. So the case that the online algorithm can have more resources than the optimal algorithm is considered, which is called the resource augmentation analysis. In this paper, the online algorithm have more machines. We show that the online algorithm can have the same performance as the optimal algorithm.

본 논문은 마감시간을 가진 작업들의 온라인 스케줄링 문제를 다룬다. 작업들이 시간이 지남에 따라 도착하고 스케줄링 알고리즘은 앞으로 도착할 작업들의 정보를 미리 알지 못한다. 작업들은 동일한 수행시간만큼 실행되고 알고리즘의 목표는 마감 시간 안에 수행을 완료한 작업들의 수를 최대화하는 것이다. 온라인 알고리즘의 성능은 모든 작업 정보를 미리 알고 최적의 답을 줄 수 있는 최적 알고리즘의 성능과 비교하는데 두 알고리즘 성능의 비를 경쟁비라고 한다. 일반적으로 정보의 부재로 인해 온라인 알고리즘은 큰 경쟁비를 가진다. 따라서 온라인 알고리즘에 보다 많은 머신 또는 보다 빠른 머신을 제공했을 때의 경쟁비를 계산하는 자원추가 분석을 수행할 수 있다. 본 논문에서는 온라인 알고리즘이 보다 많은 머신들을 이용할 수 있을 때 최적 알고리즘과 같은 성능을 낼 수 있음을 보일 것이다.

Keywords

References

  1. J. M. Moore, "A n jobs, one machine sequencing algorithm for minimizing the number of late jobs", Management Science, vol. 15, pp. 102-109, Sep. 1968. https://doi.org/10.1287/mnsc.15.1.102
  2. Philippe Baptiste, "An $O(n^{4})$ algorithm for preemptive scheduling of a single machine to minimize the number of late jobs", Operational Research Letters, vol. 24, pp. 175-180, May 1999. https://doi.org/10.1016/S0167-6377(98)00045-5
  3. Philippe Baptiste, "Polynomial time algorithms for minimizing the weighted number of jobs on a single machine with equal processing times", Journal of Scheduling, vol. 2, pp. 245-252, Nov. 1999. https://doi.org/10.1002/(SICI)1099-1425(199911/12)2:6<245::AID-JOS28>3.0.CO;2-5
  4. R. Lipton and A. Tomkins, "Online interval scheduling", in Proceeding of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, Arlington, Virginia, pp. 302-311, 1994.
  5. S. Goldman, J. Parwatikar, and S. Suri, "On-line scheduling with hard deadlines", in Proceeding of the 5th International Workshop on Algorithms and Data Structure, Halifax, Canada, pp. 258-271, 1997.
  6. M. H. Goldwasser, "Patience is a virtue: The effect of slack on competitiveness for admission control", in Proceeding of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, Baltimore, Maryland, pp. 396-405, 1999.
  7. Jae-Hoon Kim and Kyung-Yong Chwa, "Online deadline scheduling with multiple resources", in Proceeding of the 7th Annual Int. Computing and Combinatorics Conference, Guilin, China, pp. 443-452, 2001.
  8. C. Phillips, C. Stein, E. Torng, and J. Wein, "Optimal time-critical scheduling via resource augmentation", in Proceeding of the 29th Annual ACM-SIAM Symposium on Theory of Computing, El Paso, Texas, pp. 140-149, 1997.
  9. T. W. Lam and K. K. To, "Performance guarantee for online deadline scheduling in the presence of overload", in Proceeding of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, pp. 755-764, 2001.