Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling

Ahuva W. Mu'alem; Dror G. Feitelson

doi:10.1109/71.932708

Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling

Ahuva W. Mu'alem^*, Dror G. Feitelson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

576 Scopus citations

Abstract

Scheduling jobs on the IBM SP2 system and many other distributed-memory MPPs is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order in which the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. This situation led to the development of 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 compare this approach with a more conservative approach in which small jobs move ahead only if they do not delay any job in the queue and show that the relative performance of the two schemes depends on the workload: For workloads typical on SP2 systems, the aggressive approach is indeed better, but, for other workloads, both algorithms are similar. In addition, we study the sensitivity of backfilling to the accuracy of the runtime estimates provided by the users and find a very surprising result: Backfilling actually works better when users overestimate the runtime by a substantial factor.

Original language	English
Pages (from-to)	529-543
Number of pages	15
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	12
Issue number	6
DOIs	https://doi.org/10.1109/71.932708
State	Published - Jun 2001

Bibliographical note

Funding Information:
This research was supported by the Ministry of Science and Technology and by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. The workload log from the CTC SP2 was graciously provided by the Cornell Theory Center, a high-performance computing center at Cornell University, Ithaca, New York. The workload log from the KTH SP2 was graciously provided by Lars Malinowsky, who also helped with background information and interpretation. The workload log from the SDSC SP2 was graciously provided by Victor Hazlewood of the HPC Systems group of the San Diego Supercomputer Center (SDSC), which is the leading-edge site of the National Partnership for Advanced Computational Infrastructure (NPACI), and is available from the NPACI JOBLOG repository at http://joblog.npaci.edu. The code for the Jann workload model was graciously provided by Joefon Jann of IBM Research. This paper supercedes the

Keywords

Backfilling
Parallel job scheduling
Performance metrics
Runtime estimates
Workload modeling

Access to Document

10.1109/71.932708

Cite this

@article{d4212c720e5d40f898632317883d643a,

title = "Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling",

abstract = "Scheduling jobs on the IBM SP2 system and many other distributed-memory MPPs is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order in which the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. This situation led to the development of 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 compare this approach with a more conservative approach in which small jobs move ahead only if they do not delay any job in the queue and show that the relative performance of the two schemes depends on the workload: For workloads typical on SP2 systems, the aggressive approach is indeed better, but, for other workloads, both algorithms are similar. In addition, we study the sensitivity of backfilling to the accuracy of the runtime estimates provided by the users and find a very surprising result: Backfilling actually works better when users overestimate the runtime by a substantial factor.",

keywords = "Backfilling, Parallel job scheduling, Performance metrics, Runtime estimates, Workload modeling",

author = "Mu'alem, {Ahuva W.} and Feitelson, {Dror G.}",

note = "Funding Information: This research was supported by the Ministry of Science and Technology and by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. The workload log from the CTC SP2 was graciously provided by the Cornell Theory Center, a high-performance computing center at Cornell University, Ithaca, New York. The workload log from the KTH SP2 was graciously provided by Lars Malinowsky, who also helped with background information and interpretation. The workload log from the SDSC SP2 was graciously provided by Victor Hazlewood of the HPC Systems group of the San Diego Supercomputer Center (SDSC), which is the leading-edge site of the National Partnership for Advanced Computational Infrastructure (NPACI), and is available from the NPACI JOBLOG repository at http://joblog.npaci.edu. The code for the Jann workload model was graciously provided by Joefon Jann of IBM Research. This paper supercedes the",

year = "2001",

month = jun,

doi = "10.1109/71.932708",

language = "אנגלית",

volume = "12",

pages = "529--543",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "6",

}

TY - JOUR

T1 - Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling

AU - Mu'alem, Ahuva W.

AU - Feitelson, Dror G.

N1 - Funding Information: This research was supported by the Ministry of Science and Technology and by the Israel Science Foundation founded by the Israel Academy of Sciences and Humanities. The workload log from the CTC SP2 was graciously provided by the Cornell Theory Center, a high-performance computing center at Cornell University, Ithaca, New York. The workload log from the KTH SP2 was graciously provided by Lars Malinowsky, who also helped with background information and interpretation. The workload log from the SDSC SP2 was graciously provided by Victor Hazlewood of the HPC Systems group of the San Diego Supercomputer Center (SDSC), which is the leading-edge site of the National Partnership for Advanced Computational Infrastructure (NPACI), and is available from the NPACI JOBLOG repository at http://joblog.npaci.edu. The code for the Jann workload model was graciously provided by Joefon Jann of IBM Research. This paper supercedes the

PY - 2001/6

Y1 - 2001/6

N2 - Scheduling jobs on the IBM SP2 system and many other distributed-memory MPPs is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order in which the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. This situation led to the development of 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 compare this approach with a more conservative approach in which small jobs move ahead only if they do not delay any job in the queue and show that the relative performance of the two schemes depends on the workload: For workloads typical on SP2 systems, the aggressive approach is indeed better, but, for other workloads, both algorithms are similar. In addition, we study the sensitivity of backfilling to the accuracy of the runtime estimates provided by the users and find a very surprising result: Backfilling actually works better when users overestimate the runtime by a substantial factor.

AB - Scheduling jobs on the IBM SP2 system and many other distributed-memory MPPs is usually done by giving each job a partition of the machine for its exclusive use. Allocating such partitions in the order in which the jobs arrive (FCFS scheduling) is fair and predictable, but suffers from severe fragmentation, leading to low utilization. This situation led to the development of 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 compare this approach with a more conservative approach in which small jobs move ahead only if they do not delay any job in the queue and show that the relative performance of the two schemes depends on the workload: For workloads typical on SP2 systems, the aggressive approach is indeed better, but, for other workloads, both algorithms are similar. In addition, we study the sensitivity of backfilling to the accuracy of the runtime estimates provided by the users and find a very surprising result: Backfilling actually works better when users overestimate the runtime by a substantial factor.

KW - Backfilling

KW - Parallel job scheduling

KW - Performance metrics

KW - Runtime estimates

KW - Workload modeling

UR - http://www.scopus.com/inward/record.url?scp=0035363047&partnerID=8YFLogxK

U2 - 10.1109/71.932708

DO - 10.1109/71.932708

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0035363047

SN - 1045-9219

VL - 12

SP - 529

EP - 543

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 6

ER -

Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this