GPUs exhibit significantly higher peak performance than conventional CPUs. However, due to their programming model and microarchitecture, only highly parallel algorithms can exploit their full potential. In this context, the FSAI preconditioner may represent – with its inherent parallelism – an optimal candidate for the conjugate gradient-like solution of sparse linear systems. While its application to a vector involves only matrix-vector products, a GPU-based implementation requires a nontrivial recasting of multiple computational steps.

Factorized Sparse Approximate Inverses on GPUs

FANTOZZI, CARLO;FERRONATO, MASSIMILIANO;GAMBOLATI, GIUSEPPE;JANNA, CARLO
2014

Abstract

GPUs exhibit significantly higher peak performance than conventional CPUs. However, due to their programming model and microarchitecture, only highly parallel algorithms can exploit their full potential. In this context, the FSAI preconditioner may represent – with its inherent parallelism – an optimal candidate for the conjugate gradient-like solution of sparse linear systems. While its application to a vector involves only matrix-vector products, a GPU-based implementation requires a nontrivial recasting of multiple computational steps.
2014
PP14 Abstracts
File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11577/2840111
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact