Sparse Matrix-Vector Multiplication on GPGPUs
From MaRDI portal
Publication:3133580
DOI10.1145/3017994zbMath1380.65079OpenAlexW2570841452WikidataQ113310143 ScholiaQ113310143MaRDI QIDQ3133580
Alessandro Fanfarillo, Davide Barbieri, Salvatore Filippone, Valeria Cardellini
Publication date: 5 February 2018
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: http://dspace.lib.cranfield.ac.uk/handle/1826/11636
Computational methods for sparse matrices (65F50) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Related Items (10)
Decomposition in multidimensional Boolean-optimization problems with sparse matrices ⋮ GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ Efficient Algebraic Multigrid Preconditioners on Clusters of GPUs ⋮ The spectral cell method for wave propagation in heterogeneous materials simulated on multiple GPUs and CPUs ⋮ Exploiting spatial symmetries for solving Poisson's equation ⋮ GPU-based matrix-free finite element solver exploiting symmetry of elemental matrices ⋮ AMG Preconditioners for Linear Solvers towards Extreme Scale ⋮ GPGPU-based parallel computing applied in the FEM using the conjugate gradient algorithm: a review ⋮ A parallel generalized relaxation method for high-performance image segmentation on GPUs ⋮ Dynamic non-local damage analysis using an octree pattern-based massively parallel explicit solver
Uses Software
This page was built for publication: Sparse Matrix-Vector Multiplication on GPGPUs