Standards for graph algorithm primitives
Author(s)Mattson, Tim; Bader, David; Berry, Jon; Buluc, Aydin; Dongarra, Jack; Faloutsos, Christos; Feo, John; Gilbert, John; Gonzalez, Joseph; Hendrickson, Bruce; Kepner, Jeremy; Lumsdaine, Andrew; Padua, David; Poole, Stephen; Reinhardt, Steve; Wallach, Steve; Yoo, Andrew; Leiserson, Charles E.; Stonebraker, Michael; ... Show more Show less
MetadataShow full item record
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.
DepartmentLincoln Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Proceedings of the 2013 IEEE High Performance Extreme Computing Conference (HPEC)
Institute of Electrical and Electronics Engineers (IEEE)
Mattson, Tim, et al. "Standards for graph algorithm primitives." High Performance Extreme Computing Conference (HPEC) (September 2013).
Author's final manuscript