aboutsummaryrefslogtreecommitdiff
path: root/chapter/8/big-data.md
diff options
context:
space:
mode:
authormsabhi <abhi.is2006@gmail.com>2016-12-02 05:52:51 -0500
committerGitHub <noreply@github.com>2016-12-02 05:52:51 -0500
commitd8e57b0148773e05d0d21716833a12db031d3de5 (patch)
tree6225b503cbbb930f2ac22a9a5651e862c0a18f07 /chapter/8/big-data.md
parent5b948ce1ef0f531279a46e4358611402fb3433ac (diff)
Update big-data.md
Diffstat (limited to 'chapter/8/big-data.md')
-rw-r--r--chapter/8/big-data.md1
1 files changed, 1 insertions, 0 deletions
diff --git a/chapter/8/big-data.md b/chapter/8/big-data.md
index d121180..55d6b12 100644
--- a/chapter/8/big-data.md
+++ b/chapter/8/big-data.md
@@ -194,6 +194,7 @@ In BSP model
- 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**
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.