2023/01/25 by Timothy A. Davis · 3 citations
Computer Science · Engineering · #Graph Theory and Algorithms #Parallel Computing and Optimization Techniques #VLSI and FPGA Design Techniques
paper · pdf · doi:10.1145/3577195
openalex publication_date 2023/01/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/22
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.