A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU
From MaRDI portal
Publication:3454464
Recommendations
- Efficient CSR-based sparse matrix-vector multiplication on GPU
- Sparse matrix-vector multiplication on NVIDIA GPU
- A novel CSR-based sparse matrix-vector multiplication on GPUs
- Compressed multirow storage format for sparse matrices on graphics processing units
- Sparse matrix-vector multiplication on GPGPUs
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1953444 (Why is no real title available?)
- A linear time implementation of the reverse Cuthill-McKee algorithm
- A preconditioned recycling GMRES solver for stochastic Helmholtz problems
- A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
- A unified sparse matrix data format for efficient general sparse matrix-vector multiplication on modern processors with wide SIMD units
- 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
- Compressed multirow storage format for sparse matrices on graphics processing units
- Design and implementation of a parallel unstructured Euler solver using software primitives
- Finding and counting given length cycles
- Generation of large finite-element matrices on multiple graphics processors
- SparseX: a library for high-performance sparse matrix-vector multiplication on multicore platforms
This page was built for publication: A task-scheduling approach for efficient sparse symmetric matrix-vector multiplication on a GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3454464)