Standards for graph algorithm primitives

Author(s)
Mattson, Tim; Bader, David; Berry, Jon; Buluc, Aydin; Dongarra, Jack; ... Show more
Thumbnail
DownloadLeiserson_Standards for.pdf (111.6Kb)
OPEN_ACCESS_POLICY
Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
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.
Date issued
2013-09
URI
http://hdl.handle.net/1721.1/90401
Department
Lincoln Laboratory; Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
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
ISBN
978-1-4799-1365-7
978-1-4799-1364-0
Collections