GraphBLAS and GraphChallenge Advance Network Frontiers
The challenges associated with graph algorithm scaling led multiple scientists to identify the need for an abstraction layer that would allow algorithm specialists to write high-performance, matrix-based graph algorithms that hardware specialists could then design to without having to manage the com...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | en_US |
| Published: |
2022
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/1721.1/146227 |
| _version_ | 1826213525905735680 |
|---|---|
| author | Kepner, Jeremy Bader, David A. Davis, Tim Pearce, Roger Wolf, Michael M. |
| author_facet | Kepner, Jeremy Bader, David A. Davis, Tim Pearce, Roger Wolf, Michael M. |
| author_sort | Kepner, Jeremy |
| collection | MIT |
| description | The challenges associated with graph algorithm scaling led multiple scientists to identify the need for an abstraction layer that would allow algorithm specialists to write high-performance, matrix-based graph algorithms that hardware specialists could then design to without having to manage the complexities of every type of graph algorithm. With this philosophy in mind, a number of researchers (including two Turing Award winners) came together and proposed the idea 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” |
| first_indexed | 2024-09-23T15:50:38Z |
| format | Article |
| id | mit-1721.1/146227 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T15:50:38Z |
| publishDate | 2022 |
| record_format | dspace |
| spelling | mit-1721.1/1462272023-01-23T04:01:27Z GraphBLAS and GraphChallenge Advance Network Frontiers Kepner, Jeremy Bader, David A. Davis, Tim Pearce, Roger Wolf, Michael M. Linear Algebra Graph Algorithms The challenges associated with graph algorithm scaling led multiple scientists to identify the need for an abstraction layer that would allow algorithm specialists to write high-performance, matrix-based graph algorithms that hardware specialists could then design to without having to manage the complexities of every type of graph algorithm. With this philosophy in mind, a number of researchers (including two Turing Award winners) came together and proposed the idea 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” 2022-11-09T02:18:45Z 2022-11-09T02:18:45Z 2022-11-09 Article https://hdl.handle.net/1721.1/146227 en_US SIAM News Attribution-NoDerivs 3.0 United States http://creativecommons.org/licenses/by-nd/3.0/us/ application/pdf |
| spellingShingle | Linear Algebra Graph Algorithms Kepner, Jeremy Bader, David A. Davis, Tim Pearce, Roger Wolf, Michael M. GraphBLAS and GraphChallenge Advance Network Frontiers |
| title | GraphBLAS and GraphChallenge Advance Network Frontiers |
| title_full | GraphBLAS and GraphChallenge Advance Network Frontiers |
| title_fullStr | GraphBLAS and GraphChallenge Advance Network Frontiers |
| title_full_unstemmed | GraphBLAS and GraphChallenge Advance Network Frontiers |
| title_short | GraphBLAS and GraphChallenge Advance Network Frontiers |
| title_sort | graphblas and graphchallenge advance network frontiers |
| topic | Linear Algebra Graph Algorithms |
| url | https://hdl.handle.net/1721.1/146227 |
| work_keys_str_mv | AT kepnerjeremy graphblasandgraphchallengeadvancenetworkfrontiers AT baderdavida graphblasandgraphchallengeadvancenetworkfrontiers AT davistim graphblasandgraphchallengeadvancenetworkfrontiers AT pearceroger graphblasandgraphchallengeadvancenetworkfrontiers AT wolfmichaelm graphblasandgraphchallengeadvancenetworkfrontiers |