We believe that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operations is mature enough to support the emergence of a standard set of primitive building blocks. We believe that it is critical to move quickly and define such a standard; thereby freeing up researchers to innovate and diversify at the level of higher level algorithms and graph analytics applications. This effort was inspired by the Basic Linear Algebra Subprograms (BLAS) of dense Linear Algebra and hence our working name for this standard is “the Graph BLAS”.

The key insight behind this work is that when a graph is represented by a sparse incidence matrix, Sparse Matrix-vector multiplication is the dual of Breadth First Search. By generalizing the pair of operations involved in the linear algebra computations to define a semiring, we can extend the range of these primitives to support a wide range of parallel graph algorithms.

- Our manifesto for this project can be found here.
- The mathematical definition of the GraphBLAS can be found
here.
- Contribute a paper on any aspect of building blocks for graph algorithms
to the Graph Algorithms Building Blocks workshop at IPDPS (GABB'2015). Information about the
workshop can be found here.
- Background
information about graphs in the language of Linear algebra can be found in
the book:
*Graph Algorithms in the Language of Linear Algebra*, Edited by J. Kepner and J. Gilbert, SIAM, 2011. - A straw man proposal for the graph BLAS can be found here.
- We will manage communication through a
GrahsBLAS mailing list. Contact us using
this link
if you wish to join the GraphBLAS effort. If you have
problems self-subscribing to our mail group, please send an email message to our
mail-list-coordinator.

- Tim Mattson (Intel)
- Jeremy Kepner (MIT Lincoln Labs)
- David Bader (Georgia Tech)
- John Gilbert (UC Santa Barbara)
- Aydin Buluc (LBL)
- Henning Meyerhenke (KIT)