From ce6727b47cbd0d4f0ac3407b498982a09c4b3e50 Mon Sep 17 00:00:00 2001 From: msabhi Date: Thu, 17 Nov 2016 16:43:04 -0500 Subject: Update big-data.md --- chapter/8/big-data.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) (limited to 'chapter/8/big-data.md') diff --git a/chapter/8/big-data.md b/chapter/8/big-data.md index 6a3edd3..eef8a8f 100644 --- a/chapter/8/big-data.md +++ b/chapter/8/big-data.md @@ -15,7 +15,7 @@ In BSP model + At every superstep, a processor receives input at the beginning, performs computation and outputs at the end. + Barrier synchronization synchs all the processors at the end of every superstep. + -A notable feature of the model is the complete control on data through communication between every processor at every superstep.
++A notable feature of the model is the complete control on data through communication between every processor at every superstep.
Though similar to map reduce model, BSP preserves data in memory across supersteps and helps in reasoning iterative graph algorithms.
`Pregel` is an implementation of classic BSP model by Google (PageRank) to analyze large graphs exclusively. It was followed by open source implementations - Apache’s Giraph and Hama; which were BSP models built on top of Hadoop. Pregel is highly scalable, fault-tolerant and can successfully represent larger complex graphs. Google claims the API becomes easy once a developer adopts “think like a vertex” mode. -- cgit v1.2.3