Name
Abstract | ||
|---|---|---|
The GraphBLAS are building blocks for constructing graph algorithms as linear algebra. They are defined mathematically with the goal that they would eventually map onto a variety of programming languages. Today they exist in C, C++, Python, MATLAB®, and Julia. In this paper, we describe the GraphBLAS for the Go programming language. A particularly interesting aspect of this work is that using the concurrency features of the Go language, we aim to build a runtime system that uses the GraphBLAS nonblocking mode by default. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1109/IPDPSW55747.2022.00052 | 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) |
Keywords | DocType | ISSN |
GraphBLAS,Graph Algorithms,Go | Conference | 2164-7062 |
ISBN | Citations | PageRank |
978-1-6654-9748-0 | 0 | 0.34 |
References | Authors | |
6 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pascal Costanza | 1 | 0 | 0.34 |
| Ibrahim Hurt | 2 | 0 | 0.34 |
| Timothy G. Mattson | 3 | 0 | 0.34 |