Standards for graph algorithm primitives

Tim Mattson, David Bader, Jon Berry, Aydin Buluc, Jack Dongarra, Christos Faloutsos, John Feo, John Gilbert, Joseph Gonzalez, Bruce Hendrickson, Jeremy Kepner, Charles Leiserson, Andrew Lumsdaine, David Padua, Stephen Poole, Steve Reinhardt, Mike Stonebraker, Steve Wallach, Andrew Yoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

61 Scopus citations

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.

Original languageEnglish (US)
Title of host publication2013 IEEE High Performance Extreme Computing Conference, HPEC 2013
PublisherIEEE Computer Society
ISBN (Print)9781479913657
DOIs
StatePublished - 2013
Externally publishedYes
Event2013 IEEE High Performance Extreme Computing Conference, HPEC 2013 - Waltham, MA, United States
Duration: Sep 10 2013Sep 12 2013

Publication series

Name2013 IEEE High Performance Extreme Computing Conference, HPEC 2013

Conference

Conference2013 IEEE High Performance Extreme Computing Conference, HPEC 2013
Country/TerritoryUnited States
CityWaltham, MA
Period9/10/139/12/13

All Science Journal Classification (ASJC) codes

  • Software

Keywords

  • Algorithms
  • Graphs
  • Linear Algebra
  • Software Standards

Fingerprint

Dive into the research topics of 'Standards for graph algorithm primitives'. Together they form a unique fingerprint.

Cite this