2. Pregel
• A System for Large-Scale Graph Processing
• Sufficiently flexible to express arbitrary graph
algorithms
• So easy
3. Pregel: Model Of Computation
• Vertex state
• Terminate codition: all vertex are inactive
4. Pregel: Model Of Computation
• Sequence of supersteps
• Invoke compute() for each active vertex
• Each vertex can
– Modify its state, its outgoing edges
– Recive messages
– Send messages to another
13. Giraph components
• Master
– One active master at a time
– Assign partition owners to workers prior to each
superstep
– Synchronize supersteps
• Worker
– Load the graph from input
– Does the computation/messaging of its assigned
partitions