The Giraph Programming Model
This chapter covers
- Giraph design goals for graph processing
- The vertex-centric API
- Using combiners to minimize communication
- Aggregations through aggregators
- The bulk synchronous parallel model
This chapter digs into the nature of graphs and graph algorithms, and how graph algorithms can be implemented and computed with Giraph. You learn how graph problems are inherently recursive and why graph algorithms therefore are usually solved iteratively. You see how Giraph is designed for iterative graph computations and explore the vertex-centric programming API and paradigm of Giraph. You then look at examples ...