We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

GraphBLAS and GraphChallenge Advance Network Frontiers

Thumbnail Image
Download
Name

2022-10-03-SIAM News-GraphBLAS and GraphChallenge Advance Network Frontiers.pdf

Description
Updated article
Size

700.28 KB

Format

Adobe PDF

Checksum (MD5)

d81e3fc9534221e1ef2a258f2eb7c860

Author(s)
Kepner, Jeremy
•
Bader, David A.
•
Davis, Tim
•
Pearce, Roger
•
Wolf, Michael M.
Date Issued
November 9, 2022
Series/Report no.
SIAM News
Abstract
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”
Subjects
Linear Algebra
Graph Algorithms
Terms of Use
Attribution-NoDerivs 3.0 United States
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.