The MIT Libraries is completing a major upgrade to DSpace@MIT. Starting May 5 2026, DSpace will remain functional, viewable, searchable, and downloadable, however, you will not be able to edit existing collections or add new material. We are aiming to have full functionality restored by May 18, 2026 but intermittent service interruptions may occur. Please email dspace-lib@mit.edu with any questions. Thank you for your patience as we implement this important upgrade.

Show simple item record

Standards for graph algorithm primitives

dc.contributor.authorMattson, Tim
dc.contributor.authorBader, David
dc.contributor.authorBerry, Jon
dc.contributor.authorBuluc, Aydin
dc.contributor.authorDongarra, Jack
dc.contributor.authorFaloutsos, Christos
dc.contributor.authorFeo, John
dc.contributor.authorGilbert, John
dc.contributor.authorGonzalez, Joseph
dc.contributor.authorHendrickson, Bruce
dc.contributor.authorKepner, Jeremy
dc.contributor.authorLumsdaine, Andrew
dc.contributor.authorPadua, David
dc.contributor.authorPoole, Stephen
dc.contributor.authorReinhardt, Steve
dc.contributor.authorWallach, Steve
dc.contributor.authorYoo, Andrew
dc.contributor.authorLeiserson, Charles E.
dc.contributor.authorStonebraker, Michael
dc.date.accessioned2014-09-26T16:28:15Z
dc.date.available2014-09-26T16:28:15Z
dc.date.issued2013-09
dc.identifier.isbn978-1-4799-1365-7
dc.identifier.isbn978-1-4799-1364-0
dc.identifier.urihttp://hdl.handle.net/1721.1/90401
dc.description.abstractIt 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.en_US
dc.language.isoen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/HPEC.2013.6670338en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleStandards for graph algorithm primitivesen_US
dc.typeArticleen_US
dc.identifier.citationMattson, Tim, et al. "Standards for graph algorithm primitives." High Performance Extreme Computing Conference (HPEC) (September 2013).en_US
dc.contributor.departmentLincoln Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorKepner, Jeremyen_US
dc.contributor.mitauthorLeiserson, Charles E.en_US
dc.contributor.mitauthorStonebraker, Michaelen_US
dc.relation.journalProceedings of the 2013 IEEE High Performance Extreme Computing Conference (HPEC)en_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dspace.orderedauthorsMattson, Tim; Bader, David; Berry, Jon; Buluc, Aydin; Dongarra, Jack; Faloutsos, Christos; Feo, John; Gilbert, John; Gonzalez, Joseph; Hendrickson, Bruce; Kepner, Jeremy; Leiserson, Charles; Lumsdaine, Andrew; Padua, David; Poole, Stephen; Reinhardt, Steve; Stonebraker, Mike; Wallach, Steve; Yoo, Andrewen_US
dc.identifier.orcidhttps://orcid.org/0000-0001-9184-9058
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail
Name:
Leiserson_Standards for.pdf
Size:
111.6Kb
Format:
PDF
View/Open

This item appears in the following Collection(s)

Show simple item record