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. The authors 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. The conservative scheme has the added advantage that queueing times can be predicted in advance, whereas in EASY the queueing time is unbounded.
Original language | English |
---|---|
Title of host publication | Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 542-546 |
Number of pages | 5 |
ISBN (Electronic) | 0818684038, 9780818684036 |
DOIs | |
State | Published - 1998 |
Event | 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 - Orlando, United States Duration: 30 Mar 1998 → 3 Apr 1998 |
Publication series
Name | Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 |
---|---|
Volume | 1998-March |
Conference
Conference | 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing, IPPS/SPDP 1998 |
---|---|
Country/Territory | United States |
City | Orlando |
Period | 30/03/98 → 3/04/98 |
Bibliographical note
Publisher Copyright:© 1998 IEEE.