187 citations · 495 across the 8 of their papers we have counts for
4 papers · 1 filter
Combinatorial BLAS 2.0: Scaling combinatorial algorithms on distributed-memory systems
Ariful Azad, Oguz Selvitopi, Md Taufique Hussain +2
Combinatorial algorithms such as those that arise in graph analysis, modeling of discrete systems, bioinformatics, and chemistry, are often hard to parallelize. The Combinatorial B…
Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
Jeremy Kepner, David Bader, Aydın Buluc +3
The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complex…
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
Aydin Buluc, John Gilbert
Generalized sparse matrix-matrix multiplication (or SpGEMM) is a key primitive for many high performance graph algorithms as well as for some linear solvers, such as algebraic mult…
Highly Parallel Sparse Matrix-Matrix Multiplication
Aydın Buluç, John R. Gilbert
Generalized sparse matrix-matrix multiplication is a key primitive for many high performance graph algorithms as well as some linear solvers such as multigrid. We present the first…