内容简介：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)
以上就是本文的全部内容，希望本文的内容对大家的学习或者工作能带来一定的帮助，也希望大家多多支持 码农网
猜你喜欢:
本站部分资源来源于网络，本站转载出于传递更多信息之目的，版权归原作者或者来源机构所有，如转载稿涉及版权问题，请联系我们。
算法分析导论
（美）Robert Sedgewick、（法）Philippe Flajolet / 冯舜玺、李学武、裴伟东、等其他 / 机械工业出版社 / 2006-4 / 38.00元
本书阐述了用于算法数学分析的主要方法，所涉及的材料来自经典数学课题，包括离散数学、初等实分析、组合数学，以及来自经典的计算机科学课题，包括算法和数据结构，本书内容集中覆盖基础、重要和有趣的算法，前面侧重数学，后面集中讨论算法分析的应用，重点的算法分的的数学方法。每章包含大量习题以及参考文献，使读者可以更深入地理解书中的内容。 本书适合作为高等院校数学、计算机科学以及相关专业的本科生和研究生的......一起来看看 《算法分析导论》 这本书的介绍吧!
