Large Scale Graph Computation with Apache Giraph
summary
Apache Giraph is an Apache project that implements Pregel-style BSP for graphs as a map-only Hadoop job coordinated by ZooKeeper with one master and many workers, it expresses algorithms as per-vertex compute steps and trivially implements PageRank and max-value, claims about a 5x speedup over iterative MapReduce, previously scales to ~150 million objects on ~400 mappers before RPC limits, moves from Hadoop RPC to netty RPC, uses checkpointing for fault recovery, and still requires the whole partition to fit in memory so Apache Giraph and PageRank work well but large-scale fault tolerance and on-disk scaling remain work to do.
AI-written summary · about
chapters (10)
- 0:00Start
- 6:00Aggregators Combiner
- 6:23Combiners User-defined function to combine messages before being sent or delivered Similar to combiners in Hadoo - Saves on network or memory
- 6:44Checkpointing
- 8:57Single Map-Only Job
- 14:53Even more improved RPC
- 15:15Improved robustness
- 15:29YARN!
- 16:36Monitoring and metrics
- 17:00Higher-level languages
related talks
39mThorny path to the Large Scale Graph Processing
39mThorny path to the Large Scale Graph Processing
26mLarge Scale Graph Processing & Machine Learning Algorithms
30mScalable Graph-Parallel Inference Algorithms and Systems
50mBig Data on Smallish Machines
40mKeeping identity graphs in sync with Apache Spark
21mMaja Kabiljo, Software Engineer, Facebook Inc.
53mMapReduce Algorithmics
