Graph Processing on GPUs: A Survey

Research output: Contribution to journalReviewResearchpeer-review

Standard

Graph Processing on GPUs : A Survey. / Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan; Jin, Hai; He, Ligang; Liu, Bo; Hua, Qiang-Sheng.

In: A C M Computing Surveys, Vol. 50, No. 6, 81, 01.2018.

Research output: Contribution to journalReviewResearchpeer-review

Harvard

Shi, X, Zheng, Z, Zhou, Y, Jin, H, He, L, Liu, B & Hua, Q-S 2018, 'Graph Processing on GPUs: A Survey', A C M Computing Surveys, vol. 50, no. 6, 81. https://doi.org/10.1145/3128571

APA

Shi, X., Zheng, Z., Zhou, Y., Jin, H., He, L., Liu, B., & Hua, Q-S. (2018). Graph Processing on GPUs: A Survey. A C M Computing Surveys, 50(6), [81]. https://doi.org/10.1145/3128571

Vancouver

Shi X, Zheng Z, Zhou Y, Jin H, He L, Liu B et al. Graph Processing on GPUs: A Survey. A C M Computing Surveys. 2018 Jan;50(6). 81. https://doi.org/10.1145/3128571

Author

Shi, Xuanhua ; Zheng, Zhigao ; Zhou, Yongluan ; Jin, Hai ; He, Ligang ; Liu, Bo ; Hua, Qiang-Sheng. / Graph Processing on GPUs : A Survey. In: A C M Computing Surveys. 2018 ; Vol. 50, No. 6.

Bibtex

@article{7cc7b6c9767c473e98a5b2a461341808,
title = "Graph Processing on GPUs: A Survey",
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.",
keywords = "BSP model, GAS model, GPU, Graph processing, graph datasets, parallelism",
author = "Xuanhua Shi and Zhigao Zheng and Yongluan Zhou and Hai Jin and Ligang He and Bo Liu and Qiang-Sheng Hua",
year = "2018",
month = jan,
doi = "10.1145/3128571",
language = "English",
volume = "50",
journal = "A C M Computing Surveys",
issn = "0360-0300",
publisher = "Association for Computing Machinery, Inc.",
number = "6",

}

RIS

TY - JOUR

T1 - Graph Processing on GPUs

T2 - A Survey

AU - Shi, Xuanhua

AU - Zheng, Zhigao

AU - Zhou, Yongluan

AU - Jin, Hai

AU - He, Ligang

AU - Liu, Bo

AU - Hua, Qiang-Sheng

PY - 2018/1

Y1 - 2018/1

N2 - 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.

AB - 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.

KW - BSP model

KW - GAS model

KW - GPU

KW - Graph processing

KW - graph datasets

KW - parallelism

UR - http://www.scopus.com/inward/record.url?scp=85040237134&partnerID=8YFLogxK

U2 - 10.1145/3128571

DO - 10.1145/3128571

M3 - Review

VL - 50

JO - A C M Computing Surveys

JF - A C M Computing Surveys

SN - 0360-0300

IS - 6

M1 - 81

ER -

ID: 182749405