0 citations0 references

Graph Processing on GPUs

ACM Computing Surveys2018Vol. 50(6), pp. 1–35

Citations Over TimeTop 10% of 2018 papers

Xuanhua Shi, Zhigao Zheng, Yongluan Zhou, Hai Jin, Ligang He, Bo Liu, Qiang-Sheng Hua

Abstract

In the big data era, much real-world data can be naturally represented as graphs. Consequently, many application domains can be modeled as graph processing. Graph processing, especially the processing of the large-scale graphs with the number of vertices and edges in the order of billions or even hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Because of the massive degree of parallelism and the high memory access bandwidth in GPU, utilizing GPU to accelerate graph processing proves to be a promising solution. This article surveys the key issues of graph processing on GPUs, including data layout, memory access pattern, workload mapping, and specific GPU programming. In this article, we summarize the state-of-the-art research on GPU-based graph processing, analyze the existing challenges in detail, and explore the research opportunities for the future.

Related Papers

→ A Graph Database of Yelp Dataset Challenge 2018 and Using Cypher for Basic Statistics and Graph Pattern Exploration(2018)5 cited
→ Design of Declarative Graph Query Languages: On the Choice between Value, Pattern and Object Based Representations for Graphs(2012)8 cited
Implementing real time recommendation systems using graph algorithms & exploring graph analytics in a graph database platform (Neo4j)(2019)
→ Algebraic Property Graphs(2019)1 cited
→ Design and Implementation of Curriculum System Based on Knowledge Graph(2020)