Back to Search
Start Over
High Performance Exact Triangle Counting on GPUs.
- Source :
-
IEEE Transactions on Parallel & Distributed Systems . Dec2017, Vol. 28 Issue 12, p3501-3510. 10p. - Publication Year :
- 2017
-
Abstract
- This paper presents a GPU implementation of the graph triangle counting operation based on the set intersection algorithm. The algorithm is 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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 10459219
- Volume :
- 28
- Issue :
- 12
- Database :
- Academic Search Index
- Journal :
- IEEE Transactions on Parallel & Distributed Systems
- Publication Type :
- Academic Journal
- Accession number :
- 126238172
- Full Text :
- https://doi.org/10.1109/TPDS.2017.2735405