Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra Academic Article

abstract

• SuiteSparse:GraphBLAS is a full parallel implementation of the GraphBLAS standard, which defines a set of sparse matrix operations on an extended algebra of semirings using an almost unlimited variety of operators and types. When applied to sparse adjacency matrices, these algebraic operations are equivalent to computations on graphs. A description of the parallel implementation of SuiteSparse:GraphBLAS is given, including its novel parallel algorithms for sparse matrix multiply, addition, element-wise multiply, submatrix extraction and assignment, and the GraphBLAS mask/accumulator operation. Its performance is illustrated by solving the graph problems in the GAP Benchmark and by comparing it with other sparse matrix libraries.

authors

• Davis, Timothy

published proceedings

• ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE

author list (cited authors)

• Davis, T. A.

complete list of authors

• Davis, Timothy A

publication date

• September 2023

publisher

• Association for Computing Machinery (ACM)  Publisher

published in

• ACM Transactions on Mathematical Software  Journal

keywords

• Graph Algorithms
• Graphblas
• Sparse Matrices

Digital Object Identifier (DOI)

• 10.1145/3577195

start page

• 1

end page

• 30

volume

• 49

issue

• 3

URL

• http://dx.doi.org/10.1145/3577195