SparseX

DOI10.1145/3134442zbMath1484.65081OpenAlexW2781752755WikidataQ113310103 ScholiaQ113310103MaRDI QIDQ4581391

Theodoros Gkountouvas, Athena Elafrou, Kornilios Kourtis, Vasileios Karakasis, Nectarios Koziris, G. Goumas

Publication date: 17 August 2018

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3134442

zbMATH Keywords

data compressionhigh-performance computingmulticoreHPCsparse matrix-vector multiplicationSpMVscientific applicationsCSXSpMV library

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Packaged methods for numerical algorithms (65Y15)

Related Items (4)

A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU ⋮ An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method ⋮ SparseX ⋮ Approximate 1-Norm Minimization and Minimum-Rank Structured Sparsity for Various Generalized Inverses via Local Search

Uses Software

• Trilinos
• SparseMatrix
• MKL
• OSKI
• Paralution
• likwid
• STREAM

This page was built for publication: SparseX