A Method for Combining Heterogeneous Workflows in HPC Systems

HPC job scheduling relies on user-provided parameters, including the requested resources (number of computing nodes or cores) and the requested time (user-estimated runtime). These parameters are set by most schedulers when queueing a job and remain unchanged throughout the job lifecycle. Difference in time and resources requests for jobs leads to windows (gaps) with idle resources in the schedule. Such windows cause supercomputer nodes downtime. To reduce idle time, most schedulers use backfilling strategies. However, due to inaccurate user estimates of job runtime, windows show dynamic and stochastic behavior, reducing backfilling effectiveness. This paper proposes a post-scheduling method based on the use of an additional workflow of adaptive jobs. These jobs can adapt time and resources requirements according to the size of the available window. We present the simulation results, and evaluate the impact of post-scheduling on supercomputer resources utilization and job average bounded slowdown.

Authors

Institutions

Publication Details

Journal
Lobachevskii Journal of Mathematics
Published
2024-10-01
DOI
https://doi.org/10.1134/s1995080224606131
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Method for Combining Heterogeneous Workflows in HPC Systems

D. S. Lyakhovets, П. П. Константинов, А. В. Баранов
Lobachevskii Journal of Mathematics
Distributed and Parallel Computing Systems
article

A Method for Combining Heterogeneous Workflows in HPC Systems

D. S. Lyakhovets, П. П. Константинов, А. В. Баранов
article en

Abstract

HPC job scheduling relies on user-provided parameters, including the requested resources (number of computing nodes or cores) and the requested time (user-estimated runtime). These parameters are set by most schedulers when queueing a job and remain unchanged throughout the job lifecycle. Difference in time and resources requests for jobs leads to windows (gaps) with idle resources in the schedule. Such windows cause supercomputer nodes downtime. To reduce idle time, most schedulers use backfilling strategies. However, due to inaccurate user estimates of job runtime, windows show dynamic and stochastic behavior, reducing backfilling effectiveness. This paper proposes a post-scheduling method based on the use of an additional workflow of adaptive jobs. These jobs can adapt time and resources requirements according to the size of the available window. We present the simulation results, and evaluate the impact of post-scheduling on supercomputer resources utilization and job average bounded slowdown.

Lobachevskii Journal of MathematicsVol. 45(10)
Research Institute for System Studies (RU)
Openalex Percentile: Top 67%
Distributed and Parallel Computing Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.