{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:25:13Z","timestamp":1773318313136,"version":"3.50.1"},"reference-count":27,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T00:00:00Z","timestamp":1761350400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"name":"Ministry of Education, Youth and Sports of the Czech Republic","award":["ID:90254"],"award-info":[{"award-number":["ID:90254"]}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2026,3]]},"abstract":"<jats:p>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\u2019s 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.<\/jats:p>","DOI":"10.1177\/10943420251385673","type":"journal-article","created":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T11:02:17Z","timestamp":1761390137000},"page":"254-270","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fair-sharing simulator: Toward fair scheduling in batch computing systems"],"prefix":"10.1177","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6434-4433","authenticated-orcid":false,"given":"Dalibor","family":"Klus\u00e1\u010dek","sequence":"first","affiliation":[{"name":"CESNET"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-8249-2739","authenticated-orcid":false,"given":"V\u00e1clav","family":"Chlumsk\u00fd","sequence":"additional","affiliation":[{"name":"CESNET"}]}],"member":"179","published-online":{"date-parts":[[2025,10,25]]},"reference":[{"key":"e_1_3_6_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77398-8_1"},{"key":"e_1_3_6_3_1","volume-title":"PBS Professional 2024.1, Administrator\u2019s Guide","author":"Altair","year":"2024","unstructured":"Altair (2024) PBS Professional 2024.1, Administrator\u2019s Guide. Altair. https:\/\/community.altair.com\/community?id=altair_product_documentation"},{"key":"e_1_3_6_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-29400-7_10"},{"key":"e_1_3_6_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-29769-4"},{"key":"e_1_3_6_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.995"},{"key":"e_1_3_6_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.06.008"},{"key":"e_1_3_6_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47954-6_4"},{"key":"e_1_3_6_9_1","first-page":"178","volume-title":"20th Workshop on Job Scheduling Strategies for Parallel Processing","author":"Dutot P-F","year":"2016","unstructured":"Dutot P-F, Mercier M, Poquet M, et al. (2016) Batsim: a realistic language-independent resources and jobs management systems simulator. In: Desai N, Cirne W (eds) 20th Workshop on Job Scheduling Strategies for Parallel Processing. Springer, pp. 178\u2013197."},{"key":"e_1_3_6_10_1","unstructured":"e-Infra CZ (2025) e-INFRA CZ: e-infrastructure for research and development in the Czech Republic. https:\/\/www.e-infra.cz\/en"},{"key":"e_1_3_6_11_1","unstructured":"Feitelson D (2025a) Parallel workloads archive. https:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/"},{"key":"e_1_3_6_12_1","unstructured":"Feitelson D (2025b) The standard workload format. https:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/swf.html"},{"key":"e_1_3_6_13_1","first-page":"323","volume-title":"8th USENIX Symposium on Networked Systems Design and Implementation","author":"Ghodsi A","year":"2011","unstructured":"Ghodsi A, Zaharia M, Hindman B, et al. (2011) Dominant resource fairness: fair allocation of multiple resource types. 8th USENIX Symposium on Networked Systems Design and Implementation. USENIX Association, 323\u2013336."},{"key":"e_1_3_6_14_1","volume-title":"Slurm User Group Meeting","author":"Hoopes S","year":"2019","unstructured":"Hoopes S (2019) Slurm priority, fairshare and fair tree. In: Slurm User Group Meeting. SchedMD LLC."},{"key":"e_1_3_6_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45540-X_6"},{"key":"e_1_3_6_16_1","first-page":"1","volume-title":"15th International Conference on Parallel Processing and Applied Mathematics (PPAM 2024)","author":"Klus\u00e1\u010dek D","year":"2024","unstructured":"Klus\u00e1\u010dek D (2024) Fair-sharing simulator for batch computing systems. In: Wyrzykowski R (ed) 15th International Conference on Parallel Processing and Applied Mathematics (PPAM 2024). Springer, pp. 1\u201314."},{"key":"e_1_3_6_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-15789-4_4"},{"key":"e_1_3_6_18_1","first-page":"124","volume-title":"9th EAI International Conference on Simulation Tools and Techniques (Simutools 2016)","author":"Klus\u00e1\u010dek D","year":"2016","unstructured":"Klus\u00e1\u010dek D, \u0160imon T, Podoln\u00edkov\u00e1 G (2016) Complex job scheduling simulations with Alea 4. In: 9th EAI International Conference on Simulation Tools and Techniques (Simutools 2016). ACM, pp. 124\u2013129."},{"key":"e_1_3_6_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61756-5_5"},{"key":"e_1_3_6_20_1","doi-asserted-by":"crossref","unstructured":"Klus\u00e1\u010dek D Soysal M Suter F (2019) Alea - Complex job scheduling simulator. In: Wyrzykowski R Deelman E Dongarra J et al. (eds) 13th International Conference on Parallel Processing and Applied Mathematics (PPAM 2019). Springer 217\u2013229.","DOI":"10.1007\/978-3-030-43222-5_19"},{"key":"e_1_3_6_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/GCC.2007.96"},{"key":"e_1_3_6_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.01.024"},{"key":"e_1_3_6_23_1","unstructured":"Marco D\u2019Amico AJC (2018) SLURM simulator improvements and evaluation."},{"key":"e_1_3_6_24_1","first-page":"152","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Rodrigo GP","year":"2017","unstructured":"Rodrigo GP, Elmroth E, \u00d6stberg PO, et al. (2017) ScSF: a scheduling simulation framework. In: Klus\u00e1\u010dek D, Desai N, Cirne W (eds). Job Scheduling Strategies for Parallel Processing. Springer International Publishing, pp. 152\u2013173."},{"key":"e_1_3_6_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0022286"},{"key":"e_1_3_6_26_1","unstructured":"SPEC (2024) SPEC CPU\u00ae 2017 results. https:\/\/www.spec.org\/cpu2017\/results\/"},{"key":"e_1_3_6_27_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1307"},{"key":"e_1_3_6_28_1","first-page":"538","volume-title":"Practice and Experience in Advanced Research Computing, PEARC\u2019 20","author":"Yalim J","year":"2020","unstructured":"Yalim J (2020) Toward dynamically controlling Slurm\u2019s classic fairshare algorithm. In: Practice and Experience in Advanced Research Computing, PEARC\u2019 20. Association for Computing Machinery, pp. 538\u2013542."}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420251385673","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420251385673","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420251385673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T18:40:42Z","timestamp":1773254442000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420251385673"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,25]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["10.1177\/10943420251385673"],"URL":"https:\/\/doi.org\/10.1177\/10943420251385673","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,25]]}}}