Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
arXiv:1504.01039 · doi:10.1016/j.procs.2015.05.353
Abstract
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 complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istc-bigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.
10 pages; International Conference on Computational Science workshop on the Applications of Matrix Computational Methods in the Analysis of Modern Data
References in corpus (3)
Cited by in corpus (13)
- Compiler Support for Sparse Tensor Computations in MLIR
- Fast Matlab compatible sparse assembly on multicore computers
- GraphChallenge.org: Raising the Bar on Graph Analytic Performance
- From NoSQL Accumulo to NewSQL Graphulo: Design and Utility of Graph Algorithms inside a BigTable Database
- GraphBLAS on the Edge: Anonymized High Performance Streaming of Network Traffic
- Design, Generation, and Validation of Extreme Scale Power-Law Graphs
- GraphChallenge.org Triangle Counting Performance
- BigSparse: High-performance external graph analytics
- Fast Mapping onto Census Blocks
- Benchmarking the Graphulo Processing Framework
- SoK: Cryptographically Protected Database Search
- Powers of large matrices on GPU platforms to compute the Roman domination number of cylindrical graphs
- A GraphBLAS Approach for Subgraph Counting