Dynamic spawning of MPI processes applied to malleability
Ver/ Abrir
Impacto
Scholar |
Otros documentos de la autoría: Martín Álvarez, Iker; Aliaga Estellés, José Ignacio; Castillo Catalán, María Isabel; Iserte, Sergio; Mayo, Rafael
Metadatos
Mostrar el registro completo del ítemcomunitat-uji-handle:10234/9
comunitat-uji-handle2:10234/7036
comunitat-uji-handle3:10234/8620
comunitat-uji-handle4:
INVESTIGACIONMetadatos
Título
Dynamic spawning of MPI processes applied to malleabilityAutoría
Fecha de publicación
2023-05-29Editor
SAGE PublicationsISSN
1094-3420; 1741-2846Cita bibliográfica
Martín-Álvarez I, Aliaga JI, Castillo M, Iserte S, Mayo R. Dynamic spawning of MPI processes applied to malleability. The International Journal of High Performance Computing Applications. 2024;38(2):69-93. doi:10.1177/10943420231176527Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
https://journals.sagepub.com/doi/10.1177/10943420231176527Versión
info:eu-repo/semantics/acceptedVersionPalabras clave / Materias
Resumen
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 ... [+]
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. [-]
Entidad financiadora
MCIN/AEI/10.13039/ 501100011033 | Universitat Jaume I | Valencian Region Government and European Social Funds
Código del proyecto o subvención
PID2020-113656RB-C21 | UJI-B2019-36 | APOSTD/2020/026 | ACIF/2021/260
Derechos de acceso
Aparece en las colecciones
- ICC_Articles [419]