分享文章

论文阅读 - Thinking Like a Vertex: A Survey of Vertex-

原

**Thinking Like a Vertex: A Survey of Vertex-Centric Frameworks for Large-Scale Distributed Graph Processing
**ROBERT RYAN MCCUNE, TIM WENINGER, and GREG MADEY, University of Notre Dame

Highlight, page
implements user- defined programs from the perspective of a vertex rather than a graph

Highlight, page
interdependencies

Highlight, page
However, for sequential graph algorithms, which require random access to all graph data, poor locality and the indivisibility of the graph structure cause time- and resource-intensive pointer chasing between storage mediums in order to access each datum.

Highlight, page
MapReduce does not natively support iterative algo- rithms

Highlight, page 1
GRACE exposes a programming interface that, from within a given superstep, allows for prioritized exe- cution of vertices and selective receiving of messages outside of the previous superstep.

Highlight, page 2
linear deterministic greedy (LDG), a heuristic that assigns a vertex to the parti- tion with which it shares the most edges while weighted by a penalty function linearly associated with a partition’s remaining capacity.

Highlight, page 2
According to Salihoglu and Widom [2013], a dynamic repartitioning strategy must directly address (1) how to select vertices to reassign, (2) how and when to move the assigned vertices, and (3) how to locate the reassigned vertices.

Highlight, page 2
the loading and partitioning can be performed in parallel [Salihoglu and Widom 2013].

Highlight, page 2
XPregel [Bao and Suzumura 2013] supports multithreading by dividing a partition into a user-defined number of sub- partitions

Highlight, page 2
When a failure occurs, the system rolls back to the most recently saved point, all partitions are reloaded, and the entire system resumes process- ing from the checkpoint.