Utilization and predictability in scheduling the IBM SP2 with backfilling

Dror G. Feitelson*, Ahuva Mu alem Weil

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

149 Scopus citations

Abstract

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 hot 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.

Original languageAmerican English
Pages (from-to)542-546
Number of pages5
JournalProceedings of the International Parallel Processing Symposium, IPPS
StatePublished - 1998
EventProceedings of the 1998 12th International Parallel Processing Symposium and 9th Symposium on Parallel and Distributed Processing - Orlando, FL, USA
Duration: 30 Mar 19983 Apr 1998

Fingerprint

Dive into the research topics of 'Utilization and predictability in scheduling the IBM SP2 with backfilling'. Together they form a unique fingerprint.

Cite this