Skip to content

Engine Internal Documentation

pondering edited this page Mar 24, 2013 · 4 revisions

Vertex program primitive

They are : Gather, Apply, Scatter.
Please refer to PowerGraph: Distributed Graph-Parallel Computation and Natural Graph section 4.1. It's well demonstrated.

Engine execution semantics

synchronous

Overall semantics refer to section Vertex program primitive.
Notes for sync between master and replica vertex: TBD.

asynchronous

Distributed graph

The most concise and elegant approach is Vertex-Cut. Every edge is assigned exactly one machine, while vertex may have many replicas on other machines. The semantics of synchronization between master and replica vertex will be defined here later.

Dynamic Graph

TBD. see Kineograph, slides here.

Clone this wiki locally