Parallelizing Sequential Graph Computations

Wenfei Fan, Jingbo Xu, Yinghui Wu, Wenyuan Yu, Jiaxin Jiang, Zeyu Zheng, Bohan Zhang, Yang Cao, Chao Tian

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract / Description of output

This paper presents GRAPE, a parallel system for graph computations. GRAPE differs from prior systems in its ability to parallelize existing sequential graph algorithms as a whole. Underlying GRAPE are a simple programming model and a principled approach, based on partial evaluation and incremental computation. We show that sequential graph algorithms can be “plugged into” GRAPE with minor changes, and get parallelized. As long as the sequential algorithms are correct, their GRAPE parallelization guarantees to terminate with correct answers under a monotonic condition. Moreover, we show that algorithms in MapReduce, BSP and PRAM can be optimally simulated on GRAPE. In addition to the ease of programming, we experimentally verify that GRAPE achieves comparable performance to the state-of-the-art graph systems, using real-life and synthetic graphs.
Original languageEnglish
Title of host publicationSIGMOD '17 Proceedings of the 2017 ACM International Conference on Management of Data
Number of pages16
ISBN (Electronic)978-1-4503-4197-4
Publication statusPublished - 9 May 2017
Event2017 ACM International Conference on Management of Data - Chicago, United States
Duration: 14 May 201719 May 2017


Conference2017 ACM International Conference on Management of Data
Abbreviated titleSIGMOD/PODS 2017
Country/TerritoryUnited States
Internet address


Dive into the research topics of 'Parallelizing Sequential Graph Computations'. Together they form a unique fingerprint.

Cite this