{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:22:32Z","timestamp":1774120952339,"version":"3.50.1"},"reference-count":24,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"funder":[{"DOI":"10.13039\/501100004834","name":"Universitat Jaume I","doi-asserted-by":"publisher","award":["UJI-B2019-36"],"award-info":[{"award-number":["UJI-B2019-36"]}],"id":[{"id":"10.13039\/501100004834","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["ACIF\/2021\/260"],"award-info":[{"award-number":["ACIF\/2021\/260"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","award":["APOSTD\/2020\/026"],"award-info":[{"award-number":["APOSTD\/2020\/026"]}],"id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004837","name":"Ministry of Science and Innovation","doi-asserted-by":"publisher","award":["PID2020-113656RB-C21"],"award-info":[{"award-number":["PID2020-113656RB-C21"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:p> Malleability allows computing facilities to adapt their workloads through resource management systems to maximize the throughput of the facility and the efficiency of the executed jobs. This technique is based on reconfiguring a job to a different resource amount during execution and then continuing with it. One of the stages of malleability is the dynamic spawning of processes in execution time, where different decisions in this stage will affect how the next stage of data redistribution is performed, which is the most time-consuming stage. This paper describes different methods and strategies, defining eight different alternatives to spawn processes dynamically and indicates which one should be used depending on whether a strong or weak scaling application is being used. In addition, it is described for both types of applications which strategies benefit most the application performance or the system productivity. The results show that reducing the number of spawning processes by reusing the older ones can reduce reconfiguration time compared to the classical method by up to 2.6 times for expanding and up to 36 times for shrinking. Furthermore, the asynchronous strategy requires analysing the impact of oversubscription on application performance. <\/jats:p>","DOI":"10.1177\/10943420231176527","type":"journal-article","created":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T21:13:11Z","timestamp":1685394791000},"page":"69-93","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":8,"title":["Dynamic spawning of MPI processes applied to malleability"],"prefix":"10.1177","volume":"38","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3337-3298","authenticated-orcid":false,"given":"Iker","family":"Mart\u00edn-\u00c1lvarez","sequence":"first","affiliation":[{"name":"Dept Ing. y Ciencia de Los Computadores, Universitat Jaume I, Castell\u00f3n de la Plana, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8469-764X","authenticated-orcid":false,"given":"Jos\u00e9 I","family":"Aliaga","sequence":"additional","affiliation":[{"name":"Dept Ing. y Ciencia de Los Computadores, Universitat Jaume I, Castell\u00f3n de la Plana, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2826-3086","authenticated-orcid":false,"given":"Maribel","family":"Castillo","sequence":"additional","affiliation":[{"name":"Dept Ing. y Ciencia de Los Computadores, Universitat Jaume I, Castell\u00f3n de la Plana, Spain"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3654-7924","authenticated-orcid":false,"given":"Sergio","family":"Iserte","sequence":"additional","affiliation":[{"name":"Dept. of Computer Science, Barcelona Supercomputing Center, Barcelona, Spain"}]},{"given":"Rafael","family":"Mayo","sequence":"additional","affiliation":[{"name":"Dept Ing. y Ciencia de Los Computadores, Universitat Jaume I, Castell\u00f3n de la Plana, Spain"}]}],"member":"179","published-online":{"date-parts":[[2023,5,29]]},"reference":[{"key":"bibr1-10943420231176527","doi-asserted-by":"publisher","DOI":"10.3390\/app12105231"},{"key":"bibr2-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1016\/J.SOFTX.2015.10.004"},{"key":"bibr3-10943420231176527","volume":"32","author":"Bernholdt DE","year":"2018","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"bibr4-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1177\/1094342013488238"},{"key":"bibr5-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1145\/2966884.2966917"},{"key":"bibr6-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1007\/11752578_32"},{"key":"bibr7-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1016\/J.PARCO.2021.102853"},{"key":"bibr8-10943420231176527","volume-title":"Dynamic Resource Allocation for Efficient Parallel Cfd Simulations","author":"Houzeaux G","year":"2021"},{"key":"bibr9-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3022933"},{"key":"bibr10-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1109\/ICPPW.2017.36"},{"key":"bibr11-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2018.07.006"},{"key":"bibr12-10943420231176527","unstructured":"Iserte S, Pe\u00f1a AJ, Mayo R, et al. (2016) Dynamic Management of Resource Allocation for Ompss Jobs, pp. 55\u201358"},{"key":"bibr13-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-019-03034-x"},{"key":"bibr14-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1145\/2966884.2966907"},{"key":"bibr15-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1145\/3452412.3462753"},{"key":"bibr16-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.04.003"},{"key":"bibr17-10943420231176527","unstructured":"Mart\u00edn-\u00c1lvarez I, Aliaga J, Castillo MI, et al. (2021) A synthetic tool for analysing adaptive workloads. Available at: https:\/\/www.youtube.com\/watch?v=kwE2FiU3FM8#t=6h3m20s (Accessed 2022-03-15)"},{"key":"bibr18-10943420231176527","volume-title":"Malleable Synthetic Tool Manual","author":"Mart\u00edn-\u00c1lvarez I","year":"2022"},{"key":"bibr19-10943420231176527","unstructured":"Message Passing Interface Forum (2021) MPI: a message-passing interface standard. Available at: https:\/\/www.mpi-forum.org\/docs\/mpi-4.0\/mpi40-report.pdf."},{"key":"bibr20-10943420231176527","doi-asserted-by":"crossref","unstructured":"Moody A, Bronevetsky G, Mohror K, et al. (2010) Design, modeling, and evaluation of a scalable multi-level checkpointing system In: ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis (SC10). 13-19 November 2010, New Orleans, LA, USA.","DOI":"10.1109\/SC.2010.18"},{"key":"bibr21-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1145\/3458744.3473361"},{"key":"bibr22-10943420231176527","doi-asserted-by":"publisher","DOI":"10.1145\/2016039.2016078"},{"key":"bibr23-10943420231176527","first-page":"291","volume":"2","author":"Vadhiyar SS","year":"2002","journal-title":"Parallel Processing Letters"},{"key":"bibr24-10943420231176527","volume-title":"Asynchronous MPI for the Masses","author":"Wittmann M","year":"2013"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420231176527","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/10943420231176527","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/10943420231176527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,28]],"date-time":"2025-02-28T14:37:02Z","timestamp":1740753422000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/10943420231176527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["10.1177\/10943420231176527"],"URL":"https:\/\/doi.org\/10.1177\/10943420231176527","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,5,29]]}}}