SuiteSparse:GraphBLAS: graph algorithms in the language of sparse linear algebra
Tim Davis, Professor, Department of Computer Science and Engineering, Texas A&M University
3:30 – 5PM
Tuesday Oct 20, 2020
SuiteSparse:GraphBLAS is a full 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. GraphBLAS provides a powerful and expressive framework for creating graph algorithms based on the elegant mathematics of sparse matrix operations on a semiring. Key features and performance of the SuiteSparse implementation of GraphBLAS package are described. The implementation appear in Linux distros, and forms the basis of the RedisGraph module of Redis, a commercial graph database system. Graph algorithms written in GraphBLAS can rival the performance of highly-tuned specialized kernels, while being far simpler for the end user to write.
Tim Davis is a Professor in the Computer Science and Engineering Department at Texas A&M University. His primary scholarly contribution is the creation of widely-used sparse matrix algorithms and software (including x=A\b in MATLAB). Davis is a Fellow of SIAM, ACM, and IEEE.