Browse > Article

Online Non-preemptive Deadline Scheduling for Weighted Jobs  

Kim Jae-Hoon (부산외국어대학교 컴퓨터공학부)
Chang Jung-Hwan (부산외국어대학교 디지털정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.32, no.2, 2005 , pp. 68-74 More about this Journal
Abstract
In deadline scheduling, jobs have deadlines by which they are completed. The scheduling algorithm determines which jobs are executed at each time. Then only the completed jobs contribute to the throughput or gain of the algorithm. The jobs have arbitrary weights and the gain of the algorithm is given as the sum of weights of the completed jobs. The goal of the scheduling algorithm is to maximize its gain. In this paper, we consider online non-preemptive scheduling, where jobs arrive online and the scheduling algorithm has no information about jobs arriving ahead. Also the jobs cannot be preempted or rejected while they are executed. For this problem, we obtain lower bounds for any online algorithms and also we propose an optimal online algorithm meeting the lower bounds.
Keywords
online algorithm; scheduling; deadline; competitive analysis;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C.A. Phillips, C. Stein, E. Torng, and J. Wein. 'Optimal time-critical scheduling via resource augmentation,' In Proc. of 29th ACM Sym. on Theory of Computing, 140-149, 1997   DOI
2 G. Koren, D. Shasha, and S. C. Huang. 'MOCA : A multiprocessor on-line competitive algorithm for real-time system scheduling,' In Proc. of 14th Real-Time Systems Symposium, 172-181, 1993   DOI
3 L. Epstein and R. van Stee. 'Minimizing the maximum starting time on-line,' In Proc. of the 10th European Symposium on Algorithms, 449-460, 2002
4 T. Lam and K. To. 'Performance guarantee for online deadline scheduling in the presence of overload,' In Proc. of 12th ACM Sym. of Discrete Algorithms, 755-764, 2001
5 M.R. Garay and D. S. Johnson. 'Computers and Intractability, A Guide to the Theory of NP-Completeness,' Freeman, 1979
6 M. Brehob, E. Torng, and P. Uthaisombut. 'Applying extra-resource analysis to load balancing,' In Proc. of 11th ACM Sym. of Discrete Algorithms, 560-561, 2000
7 G. Koren and D. Shasha. 'Dover : An optimal on-line scheduling algorithm for overloaded real-time systems,' SIAM Journal of Computing, 24(2):318-339, 1995   DOI   ScienceOn
8 B. Kalyanasundaram and K.R. Pruhs. 'Speed is as powerful as clairvoyance,' J. of ACM, 47(4):617-643, 2000   DOI   ScienceOn
9 R. Lipton and A. Tomkins. 'Online interval scheduling,' In Proc. of 5th ACM Sym. of Discrete Algorithms, 302-311, 1994
10 M.H. Goldwasser. 'Patience is a virtue: The effect of slack on competitiveness for admission control,' In Proc. of 10th ACM Sym. of Discrete Algorithms, 396-405, 1999
11 J. Garay, J. Naor, B. Yener, and P. Zhao. 'On-line admission control and packet scheduling with interleaving,' In Proc. of IEEE INFOCOM, 2002   DOI
12 S. Goldman, J. Parwatikar, and S. Suri. 'On-line scheduling with hard deadlines,' In Proc. of the Workshop on Algorithms and Data Structures, 258-271, 1997
13 S. Baruah, G. Koren, B. Mishra, A. Raghunathan, L. Rosier, and D. Shasha. 'On-line scheduling in the presence of overload,' In Proc. of IEEE Foundations of Computer Science, 101-110, 1991   DOI
14 S. Baruah, G. Koren, D. Mao, B. Mishra, A. Raghunathan, L. Rosier, D. Shasha, and F. Wand. 'On the competitiveness of on-line task real-time task scheduling,' Journal of Real-Time Systems, 4(2):124-144, 1992   DOI