Mathematical Foundations of the GraphBLAS
Abstract
The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS 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 mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, the two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Performance measurements of prototype GraphBLAS implementations indicate that the overhead is low
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 2016
- Accession Number
- AD1145647
Entities
People
- Andrew Lumsdaine
- Aydin Buluc
- Carl Yang
- David A. Bader
- Dylan Hutchison
- Franz Franchetti
- Henning Meyerhenke
- Jeremy Kepner
- John D. Owens
- John Gilbert
- Jose Moreira
- Manoj Kumar
- Marcin Zalewski
- Peter Aaltonen
- Scott McMillan
- Timothy Mattson
Organizations
- University of California, Davis