.png){kind=icon}
返回
High Performance Exact Triangle Counting on GPUs
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2017.2735405.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a GPU implementation of the graph triangle counting operation based on the set intersection algorithm. The algorithmis implemented in four kernels optimized for different types of graphs in a code delivering performance higher than the current state-of-the-art and without preprocessing the input graph. At runtime, a lightweight heuristic is used to select the kernel to run based on the specific graph taken as input. In contrast to previous works, the presented approach takes advantage of a set intersection operation implemented via bitmaps. Moreover, the simplicity of the approach allows the code to have limited size and engineering complexity.
Keyword:
Triangle counting
graph processing
GPU computing
parallel computing
big data
CUDA
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏分享收藏 没有更多内容
没有更多内容