Standards for Graph Algorithm Primitives
arXiv:1408.0393 · doi:10.1109/HPEC.2013.6670338
Abstract
It is our view 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. This paper is a position paper defining the problem and announcing our intention to launch an open effort to define this standard.
2 pages, IEEE HPEC 2013
Cited by in corpus (14)
- The Ubiquity of Large Graphs and Surprising Challenges of Graph Processing: Extended Survey
- Graphs, Matrices, and the GraphBLAS: Seven Good Reasons
- Enabling Massive Deep Neural Networks with the GraphBLAS
- Graphulo Implementation of Server-Side Sparse Matrix Multiply in the Accumulo Database
- RedisGraph GraphBLAS Enabled Graph Database
- Associative Array Model of SQL, NoSQL, and NewSQL Databases
- GraphChallenge.org: Raising the Bar on Graph Analytic Performance
- Semi-External Memory Sparse Matrix Multiplication for Billion-Node Graphs
- Novel Graph Processor Architecture, Prototype System, and Results
- TeAAL: A Declarative Framework for Modeling Sparse Tensor Accelerators
- Design, Generation, and Validation of Extreme Scale Power-Law Graphs
- GraphChallenge.org Triangle Counting Performance
- Fast Mapping onto Census Blocks
- Constructing Adjacency Arrays from Incidence Arrays