Accelerating BFS via Data Structure-Aware Prefetching on GPU

Accelerating BFS via Data Structure-Aware Prefetching on GPU

Breadth First Search (BFS) is a key graph traversing algorithm for many graph analytics applications. In recent decades, as the scale of the graph analytics problem has become larger and larger, it has raised many interests to accelerate graph traversing on GPU. However, due to the irregular memory...

Full description

Bibliographic Details
Main Authors: Hui Guo, Libo Huang, Yashuai Lu, Jianqiao Ma, Cheng Qian, Sheng Ma, Zhiying Wang
Format: Article
Language:English
Published: IEEE 2018-01-01
Series:IEEE Access
Subjects:
Accelerator architectures
breadth first search
data structure aware
GPGPU computing
prefetching mechanism
irregular memory access
Online Access:https://ieeexplore.ieee.org/document/8493153/

Internet

https://ieeexplore.ieee.org/document/8493153/

Similar Items