Journal
SIGMOD RECORD
Volume 47, Issue 1, Pages 15-22Publisher
ASSOC COMPUTING MACHINERY
DOI: 10.1145/3277006.3277011
Keywords
-
Funding
- 973 Program [2014CB340302]
- ERC [652976]
- EPSRC [EP/M025268/1]
- NSFC [61421003, 61602023]
- Beijing Advanced Innovation Center for Big Data and Brain Computing
- NSF [IIS-1633629]
- EPSRC [EP/M025268/1] Funding Source: UKRI
Ask authors/readers for more resources
This paper presents G RAPE, a parallel GRAPh Engine for graph computations. GRAPE differs from previous graph systems in its ability to parallelize existing sequential graph algorithms as a whole, without the need for recasting the entire algorithms into a new model. Underlying G RAPE are a simple programming model, and a principled approach based on fixpoint computation with partial evaluation and incremental computation. Under a monotonic condition, G RAPE guarantees to converge at correct answers as long as the sequential algorithms are correct. We show how our familiar sequential graph algorithms can be parallelized by G RAPE. 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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available