Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environments
Ver/ Abrir
Impacto
Scholar |
Otros documentos de la autoría: Iakymchuk, Roman; Barreda Vayá, Maria; Graillat, Stef; Aliaga Estellés, José Ignacio; Quintana-Orti, Enrique S.
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
Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environmentsAutoría
Fecha de publicación
2020-06-17Editor
SageCita bibliográfica
Iakymchuk R, Vayá MB, Graillat S, Aliaga JI, Quintana-Ortí ES. Reproducibility of parallel preconditioned conjugate gradient in hybrid programming environments. The International Journal of High Performance Computing Applications. 2020;34(5):502-518. doi:10.1177/1094342020932650Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
https://journals.sagepub.com/doi/full/10.1177/1094342020932650Versión
info:eu-repo/semantics/acceptedVersionPalabras clave / Materias
Resumen
The Preconditioned Conjugate Gradient method is often employed for the solution of linear systems of equations arising in numerical simulations of physical phenomena. While being widely used, the solver is also known ... [+]
The Preconditioned Conjugate Gradient method is often employed for the solution of linear systems of equations arising in numerical simulations of physical phenomena. While being widely used, the solver is also known for its lack of accuracy while computing the residual. In this article, we propose two algorithmic solutions that originate from the ExBLAS project to enhance the accuracy of the solver as well as to ensure its reproducibility in a hybrid MPI + OpenMP tasks programming environment. One is based on ExBLAS and preserves every bit of information until the final rounding, while the other relies upon floating-point expansions and, hence, expands the intermediate precision. Instead of converting the entire solver into its ExBLAS-related implementation, we identify those parts that violate reproducibility/non-associativity, secure them, and combine this with the sequential executions. These algorithmic strategies are reinforced with programmability suggestions to assure deterministic executions. Finally, we verify these approaches on two modern HPC systems: both versions deliver reproducible number of iterations, residuals, direct errors, and vector-solutions for the overhead of less than 37.7% on 768 cores. [-]
Proyecto de investigación
European Union’s Horizon 2020 research, innovation pro-gram under the Marie Skłodowska-Curie grant agreementvia the Robust project No. 842528 as well as the ProjectHPC-EUROPA3 (INFRAIA- 2016-1-730897), with thesupport of the H2020 EC RIA Programme ; MINECO (project TIN2017-82972-R) ; Universitat Jaume I (POSDOC-A/2017/11project)Derechos de acceso
Copyright © 2020 by SAGE Publications
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/openAccess
Aparece en las colecciones
- ICC_Articles [419]