Graphs, matrices, and the GraphBLAS: Seven good reasons
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 (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.
- Authors:
-
- 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)
- Publication Date:
- Research Org.:
- Lawrence Berkeley National Laboratory (LBNL), Berkeley, CA (United States)
- Sponsoring Org.:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR); National Science Foundation (NSF)
- OSTI Identifier:
- 1208646
- Grant/Contract Number:
- AC02-05CH11231
- Resource Type:
- Accepted Manuscript
- Journal Name:
- Procedia Computer Science
- Additional Journal Information:
- Journal Volume: 51; Journal Issue: C; Journal ID: ISSN 1877-0509
- Publisher:
- Elsevier
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING; graphs; algorithms; matrices; linear algebra; software standards
Citation Formats
Kepner, Jeremy, Bader, David, Buluç, Aydın, Gilbert, John, Mattson, Timothy, and Meyerhenke, Henning. Graphs, matrices, and the GraphBLAS: Seven good reasons. United States: N. p., 2015.
Web. doi:10.1016/j.procs.2015.05.353.
Kepner, Jeremy, Bader, David, Buluç, Aydın, Gilbert, John, Mattson, Timothy, & Meyerhenke, Henning. Graphs, matrices, and the GraphBLAS: Seven good reasons. United States. https://doi.org/10.1016/j.procs.2015.05.353
Kepner, Jeremy, Bader, David, Buluç, Aydın, Gilbert, John, Mattson, Timothy, and Meyerhenke, Henning. Thu .
"Graphs, matrices, and the GraphBLAS: Seven good reasons". United States. https://doi.org/10.1016/j.procs.2015.05.353. https://www.osti.gov/servlets/purl/1208646.
@article{osti_1208646,
title = {Graphs, matrices, and the GraphBLAS: Seven good reasons},
author = {Kepner, Jeremy and Bader, David and Buluç, Aydın and Gilbert, John and Mattson, Timothy and Meyerhenke, Henning},
abstractNote = {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.},
doi = {10.1016/j.procs.2015.05.353},
journal = {Procedia Computer Science},
number = C,
volume = 51,
place = {United States},
year = {Thu Jan 01 00:00:00 EST 2015},
month = {Thu Jan 01 00:00:00 EST 2015}
}
Web of Science
Works referenced in this record:
Communication optimal parallel multiplication of sparse random matrices
conference, January 2013
- Ballard, Grey; Buluc, Aydin; Demmel, James
- Proceedings of the 25th ACM symposium on Parallelism in algorithms and architectures - SPAA '13
Approximating Betweenness Centrality in Large Evolving Networks
book, December 2014
- Bergamini, Elisabetta; Meyerhenke, Henning; Staudt, Christian L.
- 2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX)
The Combinatorial BLAS: design, implementation, and applications
journal, May 2011
- Buluç, Aydın; Gilbert, John R.
- The International Journal of High Performance Computing Applications, Vol. 25, Issue 4
The anatomy of a large-scale hypertextual Web search engine
journal, April 1998
- Brin, Sergey; Page, Lawrence
- Computer Networks and ISDN Systems, Vol. 30, Issue 1-7
Massive streaming data analytics: A case study with clustering coefficients
conference, April 2010
- Ediger, David; Jiang, Karl; Riedy, Jason
- 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
Tracking Structure of Streaming Social Networks
conference, May 2011
- Ediger, David; Riedy, Jason; Bader, David A.
- Distributed Processing, Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum
Investigating Graph Algorithms in the BSP Model on the Cray XMT
conference, May 2013
- Ediger, David; Bader, David A.
- 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)
Dynamic distributed dimensional data model (D4M) database and computation system
conference, March 2012
- Kepner, Jeremy; Arcand, William; Bergeron, William
- ICASSP 2012 - 2012 IEEE International Conference on Acoustics, Speech and Signal Processing, 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Basic Linear Algebra Subprograms for Fortran Usage
journal, September 1979
- Lawson, C. L.; Hanson, R. J.; Kincaid, D. R.
- ACM Transactions on Mathematical Software, Vol. 5, Issue 3
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
conference, December 2013
- Lugowski, Adam; Alber, David; Buluç, Aydm
- Proceedings of the 2012 SIAM International Conference on Data Mining
Parallel processing of filtered queries in attributed semantic graphs
journal, May 2015
- Lugowski, Adam; Kamil, Shoaib; Buluç, Aydın
- Journal of Parallel and Distributed Computing, Vol. 79-80
Standards for graph algorithm primitives
conference, September 2013
- Mattson, Tim; Bader, David; Berry, Jon
- 2013 IEEE High Performance Extreme Computing Conference (HPEC)
Revisiting Edge and Node Parallelism for Dynamic GPU Graph Analytics
conference, May 2014
- McLaughlin, Adam; Bader, David A.
- 2014 IEEE International Parallel & Distributed Processing Symposium Workshops (IPDPSW)
Scalable and High Performance Betweenness Centrality on the GPU
conference, November 2014
- McLaughlin, Adam; Bader, David A.
- SC14: International Conference for High Performance Computing, Networking, Storage and Analysis
Optimizing energy consumption and parallel performance for static and dynamic betweenness centrality using GPUs
conference, September 2014
- McLaughlin, Adam; Riedy, Jason; Bader, David A.
- 2014 IEEE High Performance Extreme Computing Conference (HPEC)
Parallel Graph Partitioning for Complex Networks
conference, May 2015
- Meyerhenke, Henning; Sanders, Peter; Schulz, Christian
- 2015 IEEE International Parallel and Distributed Processing Symposium (IPDPS)
Minimizing Communication in All-Pairs Shortest Paths
conference, May 2013
- Solomonik, Edgar; Buluc, Aydin; Demmel, James
- 2013 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), 2013 IEEE 27th International Symposium on Parallel and Distributed Processing
Engineering Parallel Algorithms for Community Detection in Massive Networks
journal, January 2016
- Staudt, Christian L.; Meyerhenke, Henning
- IEEE Transactions on Parallel and Distributed Systems, Vol. 27, Issue 1
Roofline: an insightful visual performance model for multicore architectures
journal, April 2009
- Williams, Samuel; Waterman, Andrew; Patterson, David
- Communications of the ACM, Vol. 52, Issue 4
Detecting communities around seed nodes in complex networks
conference, October 2014
- Staudt, Christian L.; Marrakchi, Yassine; Meyerhenke, Henning
- 2014 IEEE International Conference on Big Data (Big Data)
STINGER: High performance data structure for streaming graphs
conference, September 2012
- Ediger, David; McColl, Rob; Riedy, Jason
- 2012 IEEE Conference on High Performance Extreme Computing (HPEC)
Computing on masked data: a high performance method for improving big data veracity
conference, September 2014
- Kepner, Jeremy; Gadepally, Vijay; Michaleas, Pete
- 2014 IEEE High Performance Extreme Computing Conference (HPEC)
Genetic sequence matching using D4M big data approaches
conference, September 2014
- Dodson, Stephanie; Ricke, Darrell O.; Kepner, Jeremy
- 2014 IEEE High Performance Extreme Computing Conference (HPEC)
Parallel Graph Partitioning for Complex Networks
journal, September 2017
- Meyerhenke, Henning; Sanders, Peter; Schulz, Christian
- IEEE Transactions on Parallel and Distributed Systems, Vol. 28, Issue 9
A Flexible Open-Source Toolbox for Scalable Complex Graph Analysis
conference, December 2013
- Lugowski, Adam; Alber, David; Buluç, Aydm
- Proceedings of the 2012 SIAM International Conference on Data Mining
Algorithm 539: Basic Linear Algebra Subprograms for Fortran Usage [F1]
journal, September 1979
- Lawson, C. L.; Hanson, R. J.; Krogh, F. T.
- ACM Transactions on Mathematical Software, Vol. 5, Issue 3
The Combinatorial BLAS: design, implementation, and applications
journal, May 2011
- Buluç, Aydın; Gilbert, John R.
- The International Journal of High Performance Computing Applications, Vol. 25, Issue 4
Minimizing Communication in All-Pairs Shortest Paths
report, February 2013
- Solomonik, Edgar; Buluc, Aydin; Demmel, James
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
text, January 2011
- Buluc, Aydin; Gilbert, John
- arXiv
Works referencing / citing this record:
Scaling sparse matrix-matrix multiplication in the accumulo database
journal, January 2019
- Demirci, Gunduz Vehbi; Aykanat, Cevdet
- Distributed and Parallel Databases, Vol. 38, Issue 1
From NoSQL Accumulo to NewSQL Graphulo: Design and utility of graph algorithms inside a BigTable database
conference, September 2016
- Hutchison, Dylan; Kepner, Jeremy; Gadepally, Vijay
- 2016 IEEE High Performance Extreme Computing Conference (HPEC)
Benchmarking the graphulo processing framework
conference, September 2016
- Weale, Timothy; Gadepally, Vijay; Hutchison, Dylan
- 2016 IEEE High Performance Extreme Computing Conference (HPEC)
SoK: Cryptographically Protected Database Search
preprint, January 2017
- Fuller, Benjamin; Varia, Mayank; Yerukhimovich, Arkady
- arXiv
BigSparse: High-performance external graph analytics
preprint, January 2017
- Jun, Sang-Woo; Wright, Andy; Zhang, Sizhuo
- arXiv
Design, Generation, and Validation of Extreme Scale Power-Law Graphs
text, January 2018
- Kepner, Jeremy; Samsi, Siddharth; Arcand, William
- arXiv
A GraphBLAS Approach for Subgraph Counting
preprint, January 2019
- Chen, Langshi; Li, Jiayu; Azad, Ariful
- arXiv
Automatically Harnessing Sparse Acceleration
text, January 2020
- Ginsbach, Philip; Collie, Bruce; O'Boyle, Michael F. P.
- arXiv
GraphChallenge.org Triangle Counting Performance
text, January 2020
- Samsi, Siddharth; Kepner, Jeremy; Gadepally, Vijay
- arXiv
Fast Mapping onto Census Blocks
text, January 2020
- Kepner, Jeremy; Kipf, Andreas; Engwirda, Darren
- arXiv