Adaptive precision in block‐Jacobi preconditioning for iterative sparse linear system solvers
![Thumbnail](/xmlui/bitstream/handle/10234/182895/64719.pdf.jpg?sequence=4&isAllowed=y)
Ver/ Abrir
Impacto
![Google Scholar](/xmlui/themes/Mirage2/images/uji/logo_google.png)
![Microsoft Academico](/xmlui/themes/Mirage2/images/uji/logo_microsoft.png)
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
Adaptive precision in block‐Jacobi preconditioning for iterative sparse linear system solversAutoría
Fecha de publicación
2019-03-25Editor
WileyISSN
1532-0626; 1532-0634Cita bibliográfica
ANZT, Hartwig, et al. Adaptive precision in block‐Jacobi preconditioning for iterative sparse linear system solvers. Concurrency and Computation: Practice and Experience, 2019, vol. 31, no 6, p. e4460Tipo de documento
info:eu-repo/semantics/articleVersión de la editorial
https://onlinelibrary.wiley.com/doi/full/10.1002/cpe.4460Versión
info:eu-repo/semantics/submittedVersionPalabras clave / Materias
Resumen
We propose an adaptive scheme to reduce communication overhead caused by data movement by selectively storing the diagonal blocks of a block‐Jacobi preconditioner in different precision formats (half, single, or ... [+]
We propose an adaptive scheme to reduce communication overhead caused by data movement by selectively storing the diagonal blocks of a block‐Jacobi preconditioner in different precision formats (half, single, or double). This specialized preconditioner can then be combined with any Krylov subspace method for the solution of sparse linear systems to perform all arithmetic in double precision. We assess the effects of the adaptive precision preconditioner on the iteration count and data transfer cost of a preconditioned conjugate gradient solver. A preconditioned conjugate gradient method is, in general, a memory bandwidth‐bound algorithm, and therefore its execution time and energy consumption are largely dominated by the costs of accessing the problem's data in memory. Given this observation, we propose a model that quantifies the time and energy savings of our approach based on the assumption that these two costs depend linearly on the bit length of a floating point number. Furthermore, we use a number of test problems from the SuiteSparse matrix collection to estimate the potential benefits of the adaptive block‐Jacobi preconditioning scheme. [-]
Descripción
This is the pre-peer reviewed version of the following article: Adaptive precision in block‐Jacobi preconditioning for iterative sparse linear system solvers, which has been published in final form at https://doi.or ... [+]
This is the pre-peer reviewed version of the following article: Adaptive precision in block‐Jacobi preconditioning for iterative sparse linear system solvers, which has been published in final form at https://doi.org/10.1002/cpe.4460. This article may be used for non-commercial purposes in accordance with Wiley Terms and Conditions for Use of Self-Archived Versions. [-]
Publicado en
Concurrency and Computation: Practice and Experience, 2019, vol. 31, no 6Proyecto de investigación
Impuls und Vernetzungsfond of the Helmholtz Association. Grant Number: VH‐NG‐1241; MINECO and FEDER. Grant Number: TIN2014‐53495‐R; H2020 EU FETHPC Project. Grant Number: 732631; MathWorks; Engineering and Physical Sciences Research Council. Grant Number: EP/P020720/1; Exascale Computing Project. Grant Number: 17-SC-20-SCDerechos de acceso
Copyright © John Wiley & Sons, Inc.
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 [424]