From d63ceb8aa8c280d789e3163426ea86bff16997e0 Mon Sep 17 00:00:00 2001 From: msabhi Date: Thu, 17 Nov 2016 16:41:41 -0500 Subject: Update big-data.md --- chapter/8/big-data.md | 1 + 1 file changed, 1 insertion(+) (limited to 'chapter') diff --git a/chapter/8/big-data.md b/chapter/8/big-data.md index 9dfd1d6..6a3edd3 100644 --- a/chapter/8/big-data.md +++ b/chapter/8/big-data.md @@ -14,6 +14,7 @@ In BSP model + The processors involved have their own local memory and every processor is connected to other via a point-to-point communication. + 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.
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. -- cgit v1.2.3