Utilization and predictability in scheduling the IBM SP2 with backfilling

被引：109

作者：

Feitelson, DG ^{[1
]}

Weil, AM ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, Inst Comp Sci, IL-91904 Jerusalem, Israel

来源：

FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING | 1998年

关键词：

D O I：

10.1109/IPPS.1998.669970

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Scheduling jobs on the IBM SP2 system is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order that the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. An alternative is to use the EASY scheduler, which uses aggressive backfilling: small jobs are moved ahead to fill in holes in the schedule, provided they do not delay the first job in the queue. We show that a more conservative approach, in which small jobs move ahead only if they do not delay any job in the queue, produces essentially the same benefits in terms of utilization. Our conservative scheme has the added advantage that queueing times can be predicted in advance, whereas in EASY the queueing time is unbounded.

引用

页码：542 / 546

页数：5