Update on Static Graph Challenge on GPU
Authors:
- 1 September 2018
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
This paper presents an updated CUDA implementation of the triangle counting and k-truss decomposition, the two analytics of the Subgraph Isomorphism Graph Challenge. Algorithmic improvements and a new GPU architecture (Volta) resulted in an order of magnitude speedup.Keywords
This publication has 5 references indexed in Scilit:
- Static graph challenge on GPU2017
- Static graph challenge: Subgraph isomorphism2017
- High Performance Exact Triangle Counting on GPUsIEEE Transactions on Parallel and Distributed Systems, 2017
- A CUDA implementation of the pagerank pipeline benchmark2016
- What is Twitter, a social network or a news media?2010