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 条
  • [41] Scheduling tasks with variable deadlines
    Shih, CS
    Sha, L
    Liu, J
    SEVENTH IEEE REAL-TIME TECHNOLOGY AND APPLICATIONS SYMPOSIUM, PROCEEDINGS, 2001, : 120 - 122
  • [42] OPTIMAL SCHEDULING WITH STRICT DEADLINES
    BHATTACHARYA, PP
    EPHREMIDES, A
    IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1989, 34 (07) : 721 - 728
  • [43] Reliable Two-Timescale Scheduling in a Multi-User Downlink Channel with Hard Deadlines
    Simon, Bernd
    Destan, Mete
    Klein, Anja
    2021 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2021,
  • [44] OPTIMAL LINEAR-TIME ALGORITHM FOR UPLINK SCHEDULING OF PACKETS WITH HARD OR SOFT DEADLINES IN WIMAX
    Mohammadi, Arezou
    Akl, Selim G.
    Behnamfar, Firouz
    68TH IEEE VEHICULAR TECHNOLOGY CONFERENCE, FALL 2008, 2008, : 2014 - 2018
  • [45] Media uploading systems with hard deadlines
    Zhang, M
    Wong, J
    Tavanapong, W
    Oh, JH
    de Groen, P
    Proceedings of the Eighth IASTED International Conference on Internet and Multimedia Systems and Applications, 2004, : 305 - 310
  • [46] Predictive Edge Computing with Hard Deadlines
    Xing, Yuxuan
    Seferoglu, Hulya
    2018 IEEE INTERNATIONAL SYMPOSIUM ON LOCAL AND METROPOLITAN AREA NETWORKS (LANMAN), 2018, : 13 - 18
  • [47] Tight deadlines. Hard day
    Gilbert, Dan
    FORBES, 2014, 194 (05): : 89 - +
  • [48] On Erasure Broadcast Channels with Hard Deadlines
    Ovaisi, Zohreh
    Devroye, Natasha
    Seferoglu, Hulya
    Smida, Besma
    Tuninetti, Daniela
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2018,
  • [49] Real-Time Scheduling Over Markovian Channels: When Partial Observability Meets Hard Deadlines
    Yang, Lei
    Murugesan, Sugumar
    Zhang, Junshan
    2011 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE (GLOBECOM 2011), 2011,
  • [50] A φ-COMPETITIVE ALGORITHM FOR SCHEDULING PACKETS WITH DEADLINES
    Vesely, Pavel
    Chrobak, Marek
    Jez, Lukasz
    Sgall, Jiri
    SIAM JOURNAL ON COMPUTING, 2022, 51 (05) : 1626 - 1691
12345