Standards for graph algorithm primitives
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 int...
Gespeichert in:
Hauptverfasser: | , , , , , , , , , , , , , , , , , , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2 |
---|---|
container_issue | |
container_start_page | 1 |
container_title | |
container_volume | |
creator | Mattson, 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, Andrew |
description | 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. |
doi_str_mv | 10.1109/HPEC.2013.6670338 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6670338</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6670338</ieee_id><sourcerecordid>6670338</sourcerecordid><originalsourceid>FETCH-LOGICAL-c223t-d0a73a9e1ffeb523f24eb22a3c78aa9828d430a1132a26bcc4050671a9818cef3</originalsourceid><addsrcrecordid>eNotj81Kw0AURseFoNQ8gLjJ0k3ivXMzf0sJtRUKCuq63Exm2pHWlpkg-PZa7OpbHDiHT4hbhBYR3MPydd63EpBarQ0Q2QtROWOxM84haWWuRFXKJwCgMUoBXov7t4m_Rs5jqeMh15vMx23Nu80hp2m7r4857dOUvkO5EZeRdyVU552Jj6f5e79sVi-L5_5x1XgpaWpGYEPsAsYYBiUpyi4MUjJ5Y5mdlXbsCBiRJEs9eN-BAm3wD6H1IdJM3P17Uwhhfepz_lmf_9AvJvQ_uw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Standards for graph algorithm primitives</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Mattson, 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, Andrew</creator><creatorcontrib>Mattson, 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, Andrew</creatorcontrib><description>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.</description><identifier>EISBN: 9781479913657</identifier><identifier>EISBN: 1479913642</identifier><identifier>EISBN: 9781479913640</identifier><identifier>EISBN: 1479913650</identifier><identifier>DOI: 10.1109/HPEC.2013.6670338</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithms ; Educational institutions ; Graphs ; Laboratories ; Linear Algebra ; Software algorithms ; Software Standards ; Sparse matrices ; Vectors</subject><ispartof>2013 IEEE High Performance Extreme Computing Conference (HPEC), 2013, p.1-2</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c223t-d0a73a9e1ffeb523f24eb22a3c78aa9828d430a1132a26bcc4050671a9818cef3</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6670338$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,27906,54901</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6670338$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Mattson, Tim</creatorcontrib><creatorcontrib>Bader, David</creatorcontrib><creatorcontrib>Berry, Jon</creatorcontrib><creatorcontrib>Buluc, Aydin</creatorcontrib><creatorcontrib>Dongarra, Jack</creatorcontrib><creatorcontrib>Faloutsos, Christos</creatorcontrib><creatorcontrib>Feo, John</creatorcontrib><creatorcontrib>Gilbert, John</creatorcontrib><creatorcontrib>Gonzalez, Joseph</creatorcontrib><creatorcontrib>Hendrickson, Bruce</creatorcontrib><creatorcontrib>Kepner, Jeremy</creatorcontrib><creatorcontrib>Leiserson, Charles</creatorcontrib><creatorcontrib>Lumsdaine, Andrew</creatorcontrib><creatorcontrib>Padua, David</creatorcontrib><creatorcontrib>Poole, Stephen</creatorcontrib><creatorcontrib>Reinhardt, Steve</creatorcontrib><creatorcontrib>Stonebraker, Mike</creatorcontrib><creatorcontrib>Wallach, Steve</creatorcontrib><creatorcontrib>Yoo, Andrew</creatorcontrib><title>Standards for graph algorithm primitives</title><title>2013 IEEE High Performance Extreme Computing Conference (HPEC)</title><addtitle>HPEC</addtitle><description>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.</description><subject>Algorithms</subject><subject>Educational institutions</subject><subject>Graphs</subject><subject>Laboratories</subject><subject>Linear Algebra</subject><subject>Software algorithms</subject><subject>Software Standards</subject><subject>Sparse matrices</subject><subject>Vectors</subject><isbn>9781479913657</isbn><isbn>1479913642</isbn><isbn>9781479913640</isbn><isbn>1479913650</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2013</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj81Kw0AURseFoNQ8gLjJ0k3ivXMzf0sJtRUKCuq63Exm2pHWlpkg-PZa7OpbHDiHT4hbhBYR3MPydd63EpBarQ0Q2QtROWOxM84haWWuRFXKJwCgMUoBXov7t4m_Rs5jqeMh15vMx23Nu80hp2m7r4857dOUvkO5EZeRdyVU552Jj6f5e79sVi-L5_5x1XgpaWpGYEPsAsYYBiUpyi4MUjJ5Y5mdlXbsCBiRJEs9eN-BAm3wD6H1IdJM3P17Uwhhfepz_lmf_9AvJvQ_uw</recordid><startdate>201309</startdate><enddate>201309</enddate><creator>Mattson, Tim</creator><creator>Bader, David</creator><creator>Berry, Jon</creator><creator>Buluc, Aydin</creator><creator>Dongarra, Jack</creator><creator>Faloutsos, Christos</creator><creator>Feo, John</creator><creator>Gilbert, John</creator><creator>Gonzalez, Joseph</creator><creator>Hendrickson, Bruce</creator><creator>Kepner, Jeremy</creator><creator>Leiserson, Charles</creator><creator>Lumsdaine, Andrew</creator><creator>Padua, David</creator><creator>Poole, Stephen</creator><creator>Reinhardt, Steve</creator><creator>Stonebraker, Mike</creator><creator>Wallach, Steve</creator><creator>Yoo, Andrew</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201309</creationdate><title>Standards for graph algorithm primitives</title><author>Mattson, 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, Andrew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c223t-d0a73a9e1ffeb523f24eb22a3c78aa9828d430a1132a26bcc4050671a9818cef3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithms</topic><topic>Educational institutions</topic><topic>Graphs</topic><topic>Laboratories</topic><topic>Linear Algebra</topic><topic>Software algorithms</topic><topic>Software Standards</topic><topic>Sparse matrices</topic><topic>Vectors</topic><toplevel>online_resources</toplevel><creatorcontrib>Mattson, Tim</creatorcontrib><creatorcontrib>Bader, David</creatorcontrib><creatorcontrib>Berry, Jon</creatorcontrib><creatorcontrib>Buluc, Aydin</creatorcontrib><creatorcontrib>Dongarra, Jack</creatorcontrib><creatorcontrib>Faloutsos, Christos</creatorcontrib><creatorcontrib>Feo, John</creatorcontrib><creatorcontrib>Gilbert, John</creatorcontrib><creatorcontrib>Gonzalez, Joseph</creatorcontrib><creatorcontrib>Hendrickson, Bruce</creatorcontrib><creatorcontrib>Kepner, Jeremy</creatorcontrib><creatorcontrib>Leiserson, Charles</creatorcontrib><creatorcontrib>Lumsdaine, Andrew</creatorcontrib><creatorcontrib>Padua, David</creatorcontrib><creatorcontrib>Poole, Stephen</creatorcontrib><creatorcontrib>Reinhardt, Steve</creatorcontrib><creatorcontrib>Stonebraker, Mike</creatorcontrib><creatorcontrib>Wallach, Steve</creatorcontrib><creatorcontrib>Yoo, Andrew</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Mattson, Tim</au><au>Bader, David</au><au>Berry, Jon</au><au>Buluc, Aydin</au><au>Dongarra, Jack</au><au>Faloutsos, Christos</au><au>Feo, John</au><au>Gilbert, John</au><au>Gonzalez, Joseph</au><au>Hendrickson, Bruce</au><au>Kepner, Jeremy</au><au>Leiserson, Charles</au><au>Lumsdaine, Andrew</au><au>Padua, David</au><au>Poole, Stephen</au><au>Reinhardt, Steve</au><au>Stonebraker, Mike</au><au>Wallach, Steve</au><au>Yoo, Andrew</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Standards for graph algorithm primitives</atitle><btitle>2013 IEEE High Performance Extreme Computing Conference (HPEC)</btitle><stitle>HPEC</stitle><date>2013-09</date><risdate>2013</risdate><spage>1</spage><epage>2</epage><pages>1-2</pages><eisbn>9781479913657</eisbn><eisbn>1479913642</eisbn><eisbn>9781479913640</eisbn><eisbn>1479913650</eisbn><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.</abstract><pub>IEEE</pub><doi>10.1109/HPEC.2013.6670338</doi><tpages>2</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | EISBN: 9781479913657 |
ispartof | 2013 IEEE High Performance Extreme Computing Conference (HPEC), 2013, p.1-2 |
issn | |
language | eng |
recordid | cdi_ieee_primary_6670338 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Algorithms Educational institutions Graphs Laboratories Linear Algebra Software algorithms Software Standards Sparse matrices Vectors |
title | Standards for graph algorithm primitives |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-18T19%3A54%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Standards%20for%20graph%20algorithm%20primitives&rft.btitle=2013%20IEEE%20High%20Performance%20Extreme%20Computing%20Conference%20(HPEC)&rft.au=Mattson,%20Tim&rft.date=2013-09&rft.spage=1&rft.epage=2&rft.pages=1-2&rft_id=info:doi/10.1109/HPEC.2013.6670338&rft_dat=%3Cieee_6IE%3E6670338%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781479913657&rft.eisbn_list=1479913642&rft.eisbn_list=9781479913640&rft.eisbn_list=1479913650&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6670338&rfr_iscdi=true |