Standards for Graph Algorithm Primitives
Tim Mattson (Intel Corporation), David Bader (Georgia Institute of, Technology), Jon Berry (Sandia National Laboratory), Aydin Buluc (Lawrence, Berkeley National Laboratory), Jack Dongarra (University of Tennessee),, Christos Faloutsos (Carnegie Melon University)
TL;DR
This paper advocates for establishing a standard set of primitive graph algorithm building blocks based on linear algebra, aiming to unify and advance the development of graph algorithms.
Contribution
It introduces the idea of creating a standardized set of graph algorithm primitives and initiates an open effort to define these standards.
Findings
The state of graph algorithm primitives is mature enough for standardization.
A position paper proposing the development of a standard set of primitives.
An open effort to define and adopt these standards is announced.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.