On-line scheduling with hard deadlines - (Extended abstract)

被引：0
|
作者：
Goldman, SA [1 ]
Parwatikar, J [1 ]
Suri, S [1 ]
机构：
[1] Washington Univ, Dept Comp Sci, St Louis, MO 63130 USA
来源：
ALGORITHMS AND DATA STRUCTURES | 1997年 / 1272卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study non-preemptive, online admission control in the deadline model: each job must be either serviced prior to its deadline, or be rejected. Our setting consists of a single resource that services an online sequence of jobs; each job has a length indicating the length of time for which it needs the resource, and a delay indicating the maximum time it can wait for the service to be started. The goal is to maximize total resource utilization. We obtain a series of results, under varying assumptions of job lengths and delays.
引用
收藏
页码：258 / 271
页数：14
相关论文
共 50 条
  • [1] On-line scheduling with tight deadlines
    Koo, CY
    Lamb, TW
    Ngan, TW
    Sadakane, K
    To, KK
    THEORETICAL COMPUTER SCIENCE, 2003, 295 (1-3) : 251 - 261
  • [2] On-line scheduling with tight deadlines
    Koo, CY
    Lam, TW
    Ngan, TW
    To, KK
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 464 - 473
  • [3] Improved on-line broadcast scheduling with deadlines
    Stanley P. Y. Fung
    Feifeng Zheng
    Wun-Tat Chan
    Francis Y. L. Chin
    Chung Keung Poon
    Prudence W. H. Wong
    Journal of Scheduling, 2008, 11 : 299 - 308
  • [4] Improved on-line broadcast scheduling with deadlines
    Zheng, Feifeng
    Fung, Stanley P. Y.
    Chan, Wun-Tat
    Chin, Francis Y. L.
    Poon, Chung Keung
    Wong, Prudence W. H.
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 320 - 329
  • [5] A note on on-line broadcast scheduling with deadlines
    Han, Xin
    Guo, He
    Yin, Dawei
    Zhang, Yong
    INFORMATION PROCESSING LETTERS, 2009, 109 (03) : 204 - 207
  • [6] Improved on-line broadcast scheduling with deadlines
    Fung, Stanley P. Y.
    Zheng, Feifeng
    Chan, Wun-Tat
    Chin, Francis Y. L.
    Poon, Chung Keung
    Wong, Prudence W. H.
    JOURNAL OF SCHEDULING, 2008, 11 (04) : 299 - 308
  • [7] Online scheduling with hard deadlines
    Goldman, SA
    Parwatikar, J
    Suri, S
    JOURNAL OF ALGORITHMS, 2000, 34 (02) : 370 - 389
  • [8] Scheduling on the Gaussian Broadcast Channel with Hard Deadlines
    Tuninetti, Daniela
    Smida, Besma
    Devroye, Natasha
    Seferoglu, Hulya
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [9] Algorithms and models for the on-line vertex-covering - (Extended abstract)
    Demange, M
    Paschos, VT
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2002, 2573 : 102 - 113
  • [10] Efficient algorithms for on-line symbol ranking compression - (Extended abstract)
    Manzini, G
    ALGORITHMS - ESA'99, 1999, 1643 : 277 - 288
12345