当前位置: X-MOL 学术ACM Trans. Math. Softw. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Algorithm 1037: SuiteSparse:GraphBLAS: Parallel Graph Algorithms in the Language of Sparse Linear Algebra
ACM Transactions on Mathematical Software ( IF 2.7 ) Pub Date : 2023-09-19 , DOI: 10.1145/3577195
Timothy A. Davis 1
Affiliation  

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.



中文翻译:

算法 1037:SuiteSparse:GraphBLAS:稀疏线性代数语言的并行图算法

SuiteSparse:GraphBLAS 是 GraphBLAS 标准的完全并行实现,它使用几乎无限多种运算符和类型在半环扩展代数上定义了一组稀疏矩阵运算。当应用于稀疏邻接矩阵时,这些代数运算相当于图上的计算。给出了 SuiteSparse:GraphBLAS 并行实现的描述,包括稀疏矩阵乘法、加法、逐元素乘法、子矩阵提取和赋值以及 GraphBLAS 掩码/累加器操作的新颖并行算法。通过解决 GAP Benchmark 中的图问题并将其与其他稀疏矩阵库进行比较来说明其性能。

更新日期:2023-09-19
down
wechat
bug