{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T17:29:53Z","timestamp":1768238993745,"version":"3.49.0"},"reference-count":31,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:00:00Z","timestamp":1767484800000},"content-version":"vor","delay-in-days":3,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100004586","name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","doi-asserted-by":"publisher","award":["SEI\u2010260003\/011343\/2021"],"award-info":[{"award-number":["SEI\u2010260003\/011343\/2021"]}],"id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002322","name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior","doi-asserted-by":"publisher","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Concurrency and Computation"],"published-print":{"date-parts":[[2026,1]]},"abstract":"<jats:title>ABSTRACT<\/jats:title>\n                  <jats:p>Supercomputers play a pivotal role in advancing research and development across diverse scientific and engineering domains. However, configuring job scheduling in these systems to ensure maximum productivity and cost\u2010effectiveness is a challenge. Workload simulation emerges as a crucial tool in this context, offering a mechanism to explore job scheduling configurations in the presence of expected user behaviors. In this paper, we focus on simulation\u2010based optimization applied to tuning job scheduling configurations. We introduce a discrete\u2010event simulator that utilizes two strategies to accommodate real workload traces under varying job scheduling policies: Job shaping and job splitting. Our findings from evaluating the proposed strategies on a real\u2010world case study suggest that they allow the effective accommodation of the real workload traces used as input to the simulation of incompatible policies. By plugging the simulator into an evolutionary optimization algorithm, we also demonstrate the flexibility of the proposed strategies in helping with the proper exploration of the job scheduling configuration space.<\/jats:p>","DOI":"10.1002\/cpe.70532","type":"journal-article","created":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T16:29:10Z","timestamp":1767544150000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Workload\u2010Tailored Optimization of Job Scheduling Policies in HPC Environments"],"prefix":"10.1002","volume":"38","author":[{"given":"Jo\u00e3o Pedro M. N.","family":"dos Santos","sequence":"first","affiliation":[{"name":"MARTIN Research Group Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica (LNCC)  Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5997-0392","authenticated-orcid":false,"given":"Jos\u00e9 Eduardo Henriques","family":"da Silva","sequence":"additional","affiliation":[{"name":"MARTIN Research Group Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica (LNCC)  Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0746-4014","authenticated-orcid":false,"given":"Ant\u00f4nio Tadeu A.","family":"Gomes","sequence":"additional","affiliation":[{"name":"MARTIN Research Group Laborat\u00f3rio Nacional de Computa\u00e7\u00e3o Cient\u00edfica (LNCC)  Rio de Janeiro Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2026,1,4]]},"reference":[{"key":"e_1_2_12_2_1","volume-title":"Handbook of Simulation Optimization","author":"Fu M. C.","year":"2014"},{"key":"e_1_2_12_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61756-5_10"},{"key":"e_1_2_12_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-77398-8_9"},{"key":"e_1_2_12_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/PMBS.2018.8641556"},{"key":"e_1_2_12_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10586\u2010019\u201002905\u20105"},{"key":"e_1_2_12_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-43222-5_19"},{"key":"e_1_2_12_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3491418.3535178"},{"key":"e_1_2_12_9_1","doi-asserted-by":"publisher","DOI":"10.5753\/sscad.2024.244798"},{"key":"e_1_2_12_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.06.008"},{"key":"e_1_2_12_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47954-6_4"},{"key":"e_1_2_12_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.925004"},{"key":"e_1_2_12_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71035-6_5"},{"key":"e_1_2_12_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2014.7116905"},{"key":"e_1_2_12_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40861-8_7"},{"key":"e_1_2_12_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICACCI.2014.6968207"},{"key":"e_1_2_12_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.34"},{"key":"e_1_2_12_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48803-0_14"},{"key":"e_1_2_12_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2023.02.044"},{"key":"e_1_2_12_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2024.07.022"},{"key":"e_1_2_12_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00955-6_27"},{"key":"e_1_2_12_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3005745.3005750"},{"key":"e_1_2_12_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598\u2010024\u201056957\u20108"},{"key":"e_1_2_12_24_1","unstructured":"Y.Gu Z.Liu S.Dai et al. \u201cReinforcement Learning for Job Scheduling and Resource Management in Cloud Computing: An Algorithm\u2010Level Review \u201d(2025) https:\/\/arxiv.org\/abs\/2501.01007."},{"key":"e_1_2_12_25_1","volume-title":"Running Long HPC Jobs on Azure With Checkpointing Using LAMMPS, NAMD, and Gromacs","author":"Meiland H.","year":"2020"},{"key":"e_1_2_12_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-80084-9_1"},{"key":"e_1_2_12_27_1","first-page":"2171","article-title":"DEAP: Evolutionary Algorithms Made Easy","volume":"13","author":"Fortin F. A.","year":"2012","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_12_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015059928466"},{"key":"e_1_2_12_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40137-4"},{"key":"e_1_2_12_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-05094-1"},{"key":"e_1_2_12_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/jcc.70059"},{"key":"e_1_2_12_32_1","doi-asserted-by":"publisher","DOI":"10.1021\/acs.analchem.7b00506"}],"container-title":["Concurrency and Computation: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/cpe.70532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T04:48:34Z","timestamp":1768193314000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/cpe.70532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,1]]}},"alternative-id":["10.1002\/cpe.70532"],"URL":"https:\/\/doi.org\/10.1002\/cpe.70532","archive":["Portico"],"relation":{},"ISSN":["1532-0626","1532-0634"],"issn-type":[{"value":"1532-0626","type":"print"},{"value":"1532-0634","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1]]},"assertion":[{"value":"2025-07-28","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-19","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"e70532"}}