Performance prediction and ranking of SpMV kernels on GPU architectures

DOI10.1007/978-3-319-43659-3_7MaRDI QIDQ1693256zbMATH OpenOpenAlexFDO

Authors Christoph Lehnert, Rudolf Berrendorf, Jan P. Ecker, Florian Mannuss

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43659-3_7

zbMATH Keywords

gradient-boostinginstance-based learningk-nearest neighbors (KNN)linear regressionperformance predictionSpMV

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical algorithms for specific classes of architectures (65Y10) Complexity and performance of numerical algorithms (65Y20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Sparse matrix-vector multiplication on GPGPUs
• A novel multi-GPU parallel optimization model for the sparse matrix-vector multiplication
• Efficient CSR-based sparse matrix-vector multiplication on GPU
• Sparse matrix-vector product
• Design and implementation of adaptive SpMV library for multicore and many-core architecture

Cited in

(1)

• Design and implementation of adaptive SpMV library for multicore and many-core architecture

This page was built for publication: Performance prediction and ranking of SpMV kernels on GPU architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1693256)