diff options
| -rw-r--r-- | chapter/8/big-data.md | 2 |
1 files changed, 1 insertions, 1 deletions
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. <br /> ++A notable feature of the model is the complete control on data through communication between every processor at every superstep. <br /> Though similar to map reduce model, BSP preserves data in memory across supersteps and helps in reasoning iterative graph algorithms.<br /> `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. |