GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
From MaRDI portal
Cites work
- Adaptive methods for the computation of PageRank
- Algorithm 1000: SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra
- An in-depth analysis of stochastic Kronecker graphs
- An O(logn) parallel connectivity algorithm
- Discrete range searching primitive for the GPU and its applications
- Engineering Route Planning Algorithms
- Graph partitioning for scalable distributed graph computations
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- scientific article; zbMATH DE number 487935 (Why is no real title available?)
- scientific article; zbMATH DE number 6902744 (Why is no real title available?)
- Optimizing sparse matrix-matrix multiplication for the GPU
- Organization and maintenance of large ordered indexes
- Sparse matrix-vector multiplication on GPGPUs
- Structure prediction and computation of sparse matrix products
- The University of Florida sparse matrix collection
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5066588)
