Reproducibility strategies for parallel Preconditioned Conjugate Gradient
Impacto
Scholar |
Otros documentos de la autoría: Iakymchuk, Roman; Barreda Vayá, Maria; Wiesenberger, Matthias; 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:
INVESTIGACIONEste recurso está restringido
https://doi.org/10.1016/j.cam.2019.112697 |
Metadatos
Título
Reproducibility strategies for parallel Preconditioned Conjugate GradientAutoría
Fecha de publicación
2020-01-02Editor
ElsevierCita bibliográfica
IAKYMCHUK, Roman, et al. Reproducibility Strategies for Parallel Preconditioned Conjugate Gradient. Journal of Computational and Applied Mathematics, 2020, 371:112697.Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
https://www.sciencedirect.com/science/article/abs/pii/S0377042719307022Versión
info:eu-repo/semantics/publishedVersionPalabras clave / Materias
Resumen
The Preconditioned Conjugate Gradient method is often used in numerical simulations. While being widely used, the solver is also known for its lack of accuracy while computing the residual. In this article, we aim at ... [+]
The Preconditioned Conjugate Gradient method is often used in numerical simulations. While being widely used, the solver is also known for its lack of accuracy while computing the residual. In this article, we aim at a twofold goal: enhance the accuracy of the solver but also ensure its reproducibility in a message-passing implementation. We design and employ various strategies starting from the ExBLAS approach (through preserving every bit of information until final rounding) to its more lightweight performance-oriented variant (through expanding the intermediate precision). These algorithmic strategies are reinforced with programmability suggestions to assure deterministic executions. Finally, we verify these strategies on modern HPC systems: both versions deliver reproducible number of iterations, residuals, direct errors, and vector-solutions for the overhead of only 29% (ExBLAS) and 4% (lightweight) on 768 processes. [-]
Proyecto de investigación
European Union’s Horizon 2020 research, innovation programme under the Marie Skłodowska-Curie grant agreement via the Robust project No. 842528 as well as the Project HPC-EUROPA3 (INFRAIA-2016-1-730897), with the support of the H2020 EC RIA Programme ; MINECO (project TIN2017-82972-R) ; Universitat Jaume I (POSDOCA/2017/11).Derechos de acceso
© 2019 Elsevier B.V. All rights reserved.E
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
http://rightsstatements.org/vocab/InC/1.0/
info:eu-repo/semantics/restrictedAccess
Aparece en las colecciones
- ICC_Articles [421]