Static graph challenge on GPU
Static graph challenge on GPU
复制标题
GPU 上的静态图挑战
DOI：
10.1109/hpec.2017.8091034
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
M. Fatica
中科院分区：
文献类型：
--
作者：
M. Bisson;M. Fatica
本文详细介绍了CUDA子图同构图挑战赛的实现，这是一项旨在推动图分析领域进步的新努力。挑战包括两个图形分析：三角形计数和k-桁架。我们介绍了图三角形计数操作和k-桁架子图分解的CUDA实现。这两种实现共享相同的代码库，利用通过位图实现的集合交集操作。分析在针对不同类型的图优化的四个内核中实现。在运行时，轻量级的逻辑分析用于根据作为输入的特定图形来选择要运行的内核。
This paper presents the details of a CUDA implementation of the Subgraph Isomorphism Graph Challenge, a new effort aimed at driving progress in the graph analytics field. challenge consists of two graph analytics: triangle counting and k-truss. We present our CUDA implementation of the graph triangle counting operation and of the k-truss subgraph decomposition. Both implementations share the same codebase taking advantage of a set intersection operation implemented via bitmaps. The analytics are implemented in four kernels optimized for different types of graphs. At runtime, lightweight heuristics are used to select the kernel to run based on the specific graph taken as input.