arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1606.05790cs.MSastro-ph.IMcs.DCcs.DS
收藏

GraphBLAS的数学基础

Mathematical Foundations of the GraphBLAS

Jeremy Kepner, Peter Aaltonen, David Bader, Aydın Buluc, Franz Franchetti, John Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Sco… 展开作者

Jeremy Kepner, Peter Aaltonen, David Bader, Aydın Buluc, Franz Franchetti, John Gilbert, Dylan Hutchison, Manoj Kumar, Andrew Lumsdaine, Henning Meyerhenke, Scott McMillan, Jose Moreira, John D. Owens, Carl Yang, Marcin Zalewski, Timothy Mattson

AI总结:

本文介绍了GraphBLAS的数学基础,说明如何通过少量可组合的矩阵操作表示和处理图,并验证原型实现具有较低性能开销。

摘要:

GraphBLAS标准(GraphBlas.org)正在开发中,旨在将基于矩阵的图算法的潜力带给最广泛的受众。在数学上,GraphBLAS定义了一组核心的基于矩阵的图操作,可用于在广泛的编程环境中实现一大类图算法。本文介绍了GraphBLAS的数学基础。图通过边表示顶点之间的连接。矩阵可以使用邻接矩阵或关联矩阵来表示广泛的图。邻接矩阵通常更容易分析,而关联矩阵通常更适合表示数据。幸运的是,两者可以通过矩阵乘法轻松联系。矩阵数学的一个关键特征是,极少数的矩阵操作可用于处理非常广泛的图。这种少量操作的可组合性是GraphBLAS的基础。像GraphBLAS这样的标准只有在性能开销较低时才有效。原型GraphBLAS实现的性能测量表明,其开销很低。

英文摘要:

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. Mathematically the Graph- BLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, the two are easily connected by matrix mul- tiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑