Graphs, matrices, and the GraphBLAS: Seven good reasons
- Massachusetts Inst. of Technology., Cambridge, MA (United States)
- Georgia Inst. of Technology, Atlanta, GA (United States)
- Lawrence Berkeley National Lab., CA (United States)
- Univ. of California, Santa Barbara, CA (United States)
- Intel Corporation, Portland, OR (United States)
- Karlsruhe Inst. of Technology, Karlsruhe (Germany)
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 (istcbigdata.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.
- Research Organization:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Science Foundation (NSF)
- Grant/Contract Number:
- AC02-05CH11231
- OSTI ID:
- 1208646
- Journal Information:
- Procedia Computer Science, Vol. 51, Issue C; ISSN 1877-0509
- Publisher:
- ElsevierCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Similar Records
Evaluation of Graph Analytics Frameworks Using the GAP Benchmark Suite
GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU