Fair-sharing simulator: Toward fair scheduling in batch computing systems
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F63839172%3A_____%2F25%3A10133785" target="_blank" >RIV/63839172:_____/25:10133785 - isvavai.cz</a>
Výsledek na webu
<a href="https://doi.org/10.1177/10943420251385673" target="_blank" >https://doi.org/10.1177/10943420251385673</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1177/10943420251385673" target="_blank" >10.1177/10943420251385673</a>
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Fair-sharing simulator: Toward fair scheduling in batch computing systems
Popis výsledku v původním jazyce
Scientific computing centers or private (in-house) cloud data centers do not rely on the standard pay-as-you-go business model common in commercial clouds to allocate resources. Instead, the system is typically shared by a set of selected users, and the administrator's job is to ensure that resources are shared fairly, given the existing policies of that organization. One common approach, especially in batch systems, is to deploy a fairshare-based job prioritization in the scheduler, where a prioritization mechanism balances resource consumption so that individual users get the right shares of resources over time. In this work, we present a simulator that mimics the settings of the fair-sharing algorithm in a batch system. Using a set of experiments, we demonstrate the utility of this tool in tuning fairshare settings in a standard HPC/HTC scheduler and present the impact of (often overlooked) additional options for modifying the basic fairshare settings. Furthermore, we introduce the batch system simulator AleaNG, which allows for complex studies of the impacts of various fair-sharing and scheduling policies on the performance of the system. Last but not least, we compare the outputs of both simulators with a real Open PBS resource manager and show that they simulate fair-sharing and job execution accurately. All the findings in this paper are based on our real-world experience of running and optimizing a distributed national computing infrastructure in the Czech Republic.
Název v anglickém jazyce
Fair-sharing simulator: Toward fair scheduling in batch computing systems
Popis výsledku anglicky
Scientific computing centers or private (in-house) cloud data centers do not rely on the standard pay-as-you-go business model common in commercial clouds to allocate resources. Instead, the system is typically shared by a set of selected users, and the administrator's job is to ensure that resources are shared fairly, given the existing policies of that organization. One common approach, especially in batch systems, is to deploy a fairshare-based job prioritization in the scheduler, where a prioritization mechanism balances resource consumption so that individual users get the right shares of resources over time. In this work, we present a simulator that mimics the settings of the fair-sharing algorithm in a batch system. Using a set of experiments, we demonstrate the utility of this tool in tuning fairshare settings in a standard HPC/HTC scheduler and present the impact of (often overlooked) additional options for modifying the basic fairshare settings. Furthermore, we introduce the batch system simulator AleaNG, which allows for complex studies of the impacts of various fair-sharing and scheduling policies on the performance of the system. Last but not least, we compare the outputs of both simulators with a real Open PBS resource manager and show that they simulate fair-sharing and job execution accurately. All the findings in this paper are based on our real-world experience of running and optimizing a distributed national computing infrastructure in the Czech Republic.
Klasifikace
Druh
J<sub>imp</sub> - Článek v periodiku v databázi Web of Science
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Návaznosti výsledku
Projekt
—
Návaznosti
—
Ostatní
Rok uplatnění
2025
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Údaje specifické pro druh výsledku
Název periodika
INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS
ISSN
1094-3420
e-ISSN
1741-2846
Svazek periodika
2025
Číslo periodika v rámci svazku
14591
Stát vydavatele periodika
US - Spojené státy americké
Počet stran výsledku
17
Strana od-do
1-19
Kód UT WoS článku
001599629800001
EID výsledku v databázi Scopus
2-s2.0-105020054012