内容简介：The GraphBLAS Forum is an open effort to define standard building blocks for graph algorithms in the language of linear algebra.We believe that the state of the art in constructing a large collection of graph algorithms in terms of linear algebraic operati
Goals and premises
The GraphBLAS Forum is an open effort to define standard building blocks for graph algorithms in the language of linear algebra.
We believe 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. We believe that it is critical to move quickly and define such a standard, thereby freeing up researchers to innovate and diversify at the level of higher level algorithms and graph analytics applications. This effort was inspired by the Basic Linear Algebra Subprograms (BLAS) of dense Linear Algebra, and hence our working name for this standard is “the GraphBLAS”.
A key insight behind this work is that when a graph is represented by a sparse incidence or adjacency matrix, sparse matrix-vector multiplication is a step of breadth first search. By generalizing the pair of scalar operations involved in the linear algebra computations to define a semiring, we can extend the range of these primitives to support a wide range of parallel graph algorithms.
More information
A C reference implementation, SuiteSparse:GraphBLAS, can be downloaded from here .
Our 2013 manifesto for this project can be found here .
The mathematical definition of the GraphBLAS can be found here .
Background information about graphs in the language of linear algebra can be found in the book: Graph Algorithms in the Language of Linear Algebra , edited by J. Kepner and J. Gilbert, SIAM, 2011.
A straw man proposal for the GraphBLAS can be found here .
Gabor Szarnyas maintains a list of GraphBLAS pointers with lots of tutorial material.
Application Program Interface (API)
A short paper from IPDPSW'17 describes the rationale behind the C API design.
Version 1.0 (provisional) of theC language API is released on May 29, 2017 at the GABB workshop [1] .
Version 1.1.0 (provisional) is released on November 14, 2017.
Version 1.2.0 (final) is released on May 18, 2018. It can be downloaded from here . This is only available for archival purposes, you should use the latest version 1.3.0 below.
Version 1.3.0 (final) is released on September 25, 2019. It can be downloaded from here .
Reference Implementations
- SuiteSparse:GraphBLAS (latest version) can be downloaded from here .
Projects developing implementations of the GraphBLAS
Graph analysis systems that integrate GraphBLAS
Workshops and conferences featuring the GraphBLAS (reverse chronological)
- GrAPL 2020 @IPDPS : Submission deadline February 1, 2020
- SC2019 BOF on HPC Graph Toolkits and the GraphBLAS Forum : Session is Wed 20 Nov, 5:15pm - 6:45pm
Blogs (and other interesting discussions) on GraphBLAS
GraphBLAS mailing list
If you wish to join our effort (or just watch it), please send an email message to our mailing list coordinator .
Steering Committee (alphabetical)
- Tim Mattson (Intel)
- Henning Meyerhenke (KIT)
以上就是本文的全部内容，希望本文的内容对大家的学习或者工作能带来一定的帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
编程的修炼（中英双语）
[荷]Edsger W. Dijkstra / 裘宗燕 / 电子工业出版社 / 2013-7 / 79.00元
本书是图灵奖获得者Edsger W. Dijkstra在编程领域里的经典著作中的经典。作者基于其敏锐的洞察力和长期的实际编程经验，对基本顺序程序的描述和开发中的许多关键问题做了独到的总结和开发。书中讨论了顺序程序的本质特征、程序描述和对程序行为（正确性）的推理，并通过一系列从简单到复杂的程序的思考和开发范例，阐释了基于严格的逻辑推理开发正确可靠程序的过程。 本书写于20世纪70年代中后期，但......一起来看看 《编程的修炼（中英双语）》 这本书的介绍吧!
