GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

Conference · Sun Nov 15 00:00:00 EST 2015

DOI:https://doi.org/10.1145/2807591.2807655· OSTI ID:1254609

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil; Schwan, Karsten

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host and device.

• Research Organization: Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
• Sponsoring Organization: USDOE
• DOE Contract Number: AC05-76RL01830
• OSTI ID: 1254609
• Report Number(s): PNNL-SA-112478; KJ0402000
• Resource Relation: Conference: Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis (SC'15), November 15-20, 2015, Austin, Texas, Paper No. 28
• Country of Publication: United States
• Language: English

Related Subjects

Architecture optimization
reuse
performance
energy
locality
cache