PROCESSING TIMES FOR SEGMENTED JOBS WITH I/O COMPUTE OVERLAP

被引：0

作者：

COTTEN, LW

ABDALLA, AM

机构：

[1] NATL SECUR AGCY,R71,FT MEADE,MD 20755

[2] GEORGE WASHINGTON UNIV,SCH ENGN,WASHINGTON,DC 20006

来源：

JOURNAL OF THE ACM | 1974年 / 21卷 / 01期

关键词：

D O I：

10.1145/321796.321799

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：18 / 30

页数：13

共 50 条

[41] Preemptive scheduling of parallel jobs of two sizes with controllable processing times
Akiyoshi Shioura
Vitaly A. Strusevich
Natalia V. Shakhlevich
Journal of Scheduling, 2024, 27 : 203 - 224
[42] Performance and energy aware cluster-level scheduling of compute-intensive jobs with unknown service times
Zikos, Stylianos
Karatza, Helen D.
SIMULATION MODELLING PRACTICE AND THEORY, 2011, 19 (01) : 239 - 250
[43] Breaking the I/O bottleneck for high compute performance processing with xtensa LX configurable and extensible processor architecture
Ezer, G
Embedded Processors for Multimedia and Communications II, 2005, 5683 : 32 - 42
[44] LS Algorithm for Semi-online Scheduling Jobs with Nondecreasing Release Times and Nondecreasing Processing Times
Tang, F.
Nie, J.
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL APPLICATIONS (CISIA 2015), 2015, 18 : 569 - 572
[45] Scheduling jobs with equal processing times and a single server on parallel identical machines
Zhang, An
Wang, Hongjun
Chen, Yong
Chen, Guangting
DISCRETE APPLIED MATHEMATICS, 2016, 213 : 196 - 206
[46] Scheduling jobs with equal processing times and time windows on identical parallel machines
Peter Brucker
Svetlana A. Kravchenko
Journal of Scheduling, 2008, 11 : 229 - 237
[47] SEQUENCING N JOBS ON 2 MACHINES WITH SETUP, PROCESSING AND REMOVAL TIMES SEPARATED
SULE, DR
NAVAL RESEARCH LOGISTICS, 1982, 29 (03) : 517 - 519
[48] An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan
Ji, Min
Cheng, T. C. E.
INFORMATION PROCESSING LETTERS, 2007, 102 (2-3) : 41 - 47
[49] SCHEDULING JOBS, WITH EXPONENTIALLY DISTRIBUTED PROCESSING TIMES, ON 2 MACHINES OF A FLOW SHOP
CUNNINGHAM, AA
DUTTA, SK
NAVAL RESEARCH LOGISTICS, 1973, 20 (01) : 69 - 81
[50] Minimizing total weighted flow time of a set of jobs with interval processing times
Sotskov, Yu. N.
Egorova, N. G.
Lai, T-C
MATHEMATICAL AND COMPUTER MODELLING, 2009, 50 (3-4) : 556 - 573

← 1 2 3 4 5 →