A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU

DOI10.1137/14097135XzbMath1343.65046OpenAlexW2208875625MaRDI QIDQ3454464

M. Mrozowski, Piotr Mironowicz, A. Dziekonski

Publication date: 25 November 2015

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/14097135x

zbMATH Keywords

KeplerGPUIntel MKLRCMsparse symmetric matrix-vector product

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for specific classes of architectures (65Y10)

Uses Software

• CUDA
• SparseMatrix
• CUSPARSE
• KEPLER
• SELL_C_sigma

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
• Compressed Multirow Storage Format for Sparse Matrices on Graphics Processing Units
• A Unified Sparse Matrix Data Format for Efficient General Sparse Matrix-Vector Multiplication on Modern Processors with Wide SIMD Units
• Generation of large finite-element matrices on multiple graphics processors
• Accelerating the Explicitly Restarted Arnoldi Method with GPUs Using an Autotuned Matrix Vector Product
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• A linear time implementation of the reverse Cuthill-McKee algorithm
• Design and implementation of a parallel unstructured Euler solver using software primitives
• SparseX

This page was built for publication: A Task-Scheduling Approach for Efficient Sparse Symmetric Matrix-Vector Multiplication on a GPU