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 条

[1] Online scheduling with hard deadlines on parallel machines
Ding, Jihuan
Zhang, Guochuan
ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, PROCEEDINGS, 2006, 4041 : 32 - 42
[2] Online Packet Scheduling with Hard Deadlines in Multihop Communication Networks
Mao, Zhoujia
Koksal, C. Emre
Shroff, Ness B.
2013 PROCEEDINGS IEEE INFOCOM, 2013, : 2463 - 2471
[3] Lex-optimal online multiclass scheduling with hard deadlines
Hajek, B
Seri, P
MATHEMATICS OF OPERATIONS RESEARCH, 2005, 30 (03) : 562 - 596
[4] Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks
Mao, Zhoujia
Koksal, Can Emre
Shroff, Ness B.
IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (01) : 177 - 189
[5] Online Scheduling of Packets with Agreeable Deadlines
Jez, Lukasz
Li, Fei
Sethuraman, Jay
Stein, Clifford
ACM TRANSACTIONS ON ALGORITHMS, 2012, 9 (01)
[6] Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines
Krumke, Sven O.
Taudes, Alfred
Westphal, Stephan
COMPUTERS & OPERATIONS RESEARCH, 2011, 38 (08) : 1103 - 1108
[7] 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,
[8] Asymptotically Optimal Online Scheduling With Arbitrary Hard Deadlines in Multi-Hop Communication Networks
Gu, Yan
Liu, Bo
Shen, Xiaojun
IEEE-ACM TRANSACTIONS ON NETWORKING, 2021, 29 (04) : 1452 - 1466
[9] Online scheduling of parallel communications with individual deadlines
Lee, JH
Chwa, KY
ALGORITHMS AND COMPUTATIONS, 2000, 1741 : 383 - 392
[10] Combining (mn)-hard deadlines and dual priority scheduling
Bernat, G
Burns, A
18TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1997, : 46 - 57

← 1 2 3 4 5 →