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 条

[31] Online real-time preemptive scheduling of jobs with deadlines on multiple machines
Das Gupta, B
Palis, MA
JOURNAL OF SCHEDULING, 2001, 4 (06) : 297 - 312
[32] Optimal linear-time algorithm for uplink scheduling of packets with hard deadlines in WiMAX
Mohammadi, Arezou
Akl, Selim G.
Behnamfart, Firouz
2008 24TH BIENNIAL SYMPOSIUM ON COMMUNICATIONS, 2008, : 39 - 42
[33] Energy-Efficient Flow Scheduling and Routing with Hard Deadlines in Data Center Networks
Wang, Lin
Zhang, Fa
Zheng, Kai
Vasilakos, Athanasios V.
Ren, Shaolei
Liu, Zhiyong
2014 IEEE 34TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS (ICDCS 2014), 2014, : 248 - 257
[34] Job shop scheduling with deadlines
Balas, E
Lancia, G
Serafini, P
Vazacopoulos, A
JOURNAL OF COMBINATORIAL OPTIMIZATION, 1998, 1 (04) : 329 - 353
[35] A 4/3-COMPETITIVE RANDOMIZED ALGORITHM FOR ONLINE SCHEDULING OF PACKETS WITH AGREEABLE DEADLINES
Jez, Lukasz
27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 489 - 499
[36] SCHEDULING WITH DEADLINES AND LOSS FUNCTIONS
MCNAUGHTON, R
MANAGEMENT SCIENCE, 1959, 6 (01) : 1 - 12
[37] Optimal scheduling with strict deadlines
Bhattacharya, Partha P., 1600, (34):
[38] Scheduling with due dates and deadlines
Gordon, V
Finke, G
Proth, JM
ISIE 2002: PROCEEDINGS OF THE 2002 IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL ELECTRONICS, VOLS 1-4, 2002, : 223 - 227
[39] ON NONPREEMPTIVE LCFS SCHEDULING WITH DEADLINES
SCHMID, U
BLIEBERGER, J
JOURNAL OF ALGORITHMS, 1995, 18 (01) : 124 - 158
[40] Job Shop Scheduling With Deadlines
Egon Balas
Giuseppe Lancia
Paolo Serafini
Alkiviadis Vazacopoulos
Journal of Combinatorial Optimization, 1998, 1 : 329 - 353

← 1 2 3 4 5 →