Standards for graph algorithm primitives
Name
Leiserson_Standards for.pdf
Size
111.68 KB
Format
Adobe PDF
Checksum (MD5)
cb80f6174b65457cfbbe7f87678e90c4
Author(s)
Mattson, Tim
Bader, David
Berry, Jon
Buluc, Aydin
Dongarra, Jack
Faloutsos, Christos
Feo, John
Gilbert, John
Gonzalez, Joseph
Hendrickson, Bruce
Date Issued
September 2013
Journal
Proceedings of the 2013 IEEE High Performance Extreme Computing Conference (HPEC)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Mattson, Tim, et al. "Standards for graph algorithm primitives." High Performance Extreme Computing Conference (HPEC) (September 2013).
Version
Author's final manuscript
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.
MIT Department
Lincoln Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/HPEC.2013.6670338
