About the granularity portability of block‐based Krylov methods in heterogeneous computing environments
| Autor: | L. Carracciuolo, Valeria Mele, Lukasz Szustak |
|---|---|
| Přispěvatelé: | Carracciuolo, L., Mele, V., Szustak, L. |
| Rok vydání: | 2020 |
| Předmět: |
iterative method
parallel computing performance models performance portability parallel computing Computer Networks and Communications Iterative method Computer science Symmetric multiprocessor system Parallel computing Computer Science Applications Theoretical Computer Science Software portability performance models Computational Theory and Mathematics Block (telecommunications) Granularity Software performance portability |
| Zdroj: | Concurrency and Computation: Practice and Experience (2020). doi:10.1002/cpe.6008 info:cnr-pdr/source/autori:Luisa Carracciuolo, Valeria Mele, Lukasz Szustak/titolo:About the Granularity Portability of block-based Krylov methods in heterogeneous computing environments/doi:10.1002%2Fcpe.6008/rivista:Concurrency and Computation: Practice and Experience/anno:2020/pagina_da:/pagina_a:/intervallo_pagine:/volume |
| ISSN: | 1532-0634 1532-0626 |
| DOI: | 10.1002/cpe.6008 |
| Popis: | Large-scale problems in engineering and science often require the solution of sparse linear algebra problems and the Krylov subspace iteration methods (KM) have led to a major change in how users deal with them. But, for these solvers to use extreme- scale hardware efficiently a lot of work was spent to redesign both the KM algorithms and their implementations to address challenges like extreme concurrency, complex memory hierarchies, costly data movement, and heterogeneous node architectures. All the redesign approaches bases the KM algorithm on block-based strategies which lead to the Block-KM (BKM) algorithm which has high granularity (i.e., the ratio of computation time to communication time). The work proposes novel parallel revisitation of the modules used in BKM which are based on the overlapping of communication and computation. Such revisitation is evaluated by a model of their granularity and verified on the basis of a case study related to a classical problem from numerical linear algebra. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Plný text