Online scheduling with hard deadlines

被引：43
|
作者：
Goldman, SA [1 ]
Parwatikar, J [1 ]
Suri, S [1 ]
机构：
[1] Washington Univ, St Louis, MO 63130 USA
来源：
JOURNAL OF ALGORITHMS | 2000年 / 34卷 / 02期
基金：
美国国家科学基金会;
关键词：
* An earlier version appears in Proceedings of the Workshop on Algorithms and Data Structures; pages; 258—271; August 1997. ²Supported in part by NSF Grant CCR-9110108 and NSF National Young Investigator Grant CCR-9357707 with matching funds provided by Xerox PARC and WUTA. ³Research supported in part by Defense Advanced Research Projects Agency under Contract DABT-63-95-C-0083. §Research supported in part by National Science Foundation Grant CCR-9501494;
D O I：
10.1006/jagm.1999.1060
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study non-preemptive, online admission control in the hard deadline model: each job must either be 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. The jobs are non-preemptive and exclusive, meaning once a job begins, it runs to completion, and at most one job fan use the resource at any time. We obtain a series of results, under varying assumptions of job lengths and delays. (C) 2000 Academic Press.
引用
收藏
页码：370 / 389
页数：20
相关论文
共 50 条
  • [11] On-line scheduling with hard deadlines - (Extended abstract)
    Goldman, SA
    Parwatikar, J
    Suri, S
    ALGORITHMS AND DATA STRUCTURES, 1997, 1272 : 258 - 271
  • [12] An optimal online algorithm for packet scheduling with agreeable deadlines
    Li, Fei
    Sethuraman, Jay
    Stein, Clifford
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 801 - 802
  • [13] Scheduling Observers Over a Shared Channel With Hard Delivery Deadlines
    Jurdi, Rebal
    Andrews, Jeffrey G.
    Heath, Robert W., Jr.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (01) : 133 - 148
  • [14] User Association and Scheduling With Hard Deadlines in Heterogeneous Cellular Networks
    Mlika, Zoubeir
    Driouch, Elmahdi
    Ajib, Wessam
    IEEE COMMUNICATIONS LETTERS, 2017, 21 (12) : 2698 - 2701
  • [15] Competitive Scheduling of Packets with Hard Deadlines in a Finite Capacity Queue
    Li, Fei
    IEEE INFOCOM 2009 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-5, 2009, : 1062 - 1070
  • [16] Optimal Distributed Scheduling of Real-Time Traffic with Hard Deadlines
    Lu, Ning
    Li, Bin
    Srikant, R.
    Ying, Lei
    2016 IEEE 55TH CONFERENCE ON DECISION AND CONTROL (CDC), 2016, : 4408 - 4413
  • [17] Batch scheduling with deadlines on parallel machines: An NP-hard case
    Kovalyov, MY
    Shafransky, YM
    INFORMATION PROCESSING LETTERS, 1997, 64 (02) : 69 - 74
  • [18] Batch scheduling with deadlines on parallel machines: An NP-hard case
    Institute of Engineering Cybernetics, Natl. Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus
    Inf. Process. Lett., 2 (69-74):
  • [19] Online scheduling of jobs with kind release times and deadlines on a single machine
    Li Wen-jie
    Ma Ran
    Feng Qi
    APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B, 2019, 34 (01) : 113 - 126
  • [20] Online scheduling of jobs with kind release times and deadlines on a single machine
    Wen-jie Li
    Ran Ma
    Qi Feng
    Applied Mathematics-A Journal of Chinese Universities, 2019, 34 : 113 - 126
12345