aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authormsabhi <abhi.is2006@gmail.com>2016-12-16 23:05:54 -0500
committerGitHub <noreply@github.com>2016-12-16 23:05:54 -0500
commit313f5c7bdd02346683b376f54301792e9f2e48f5 (patch)
treed1565390348a074f66ae2f58628dfd15ab3e7f57
parent10f49e63abb6a4ad837e8ff7f830218cd22c9b39 (diff)
Update big-data.md
-rw-r--r--chapter/8/big-data.md2
1 files changed, 1 insertions, 1 deletions
diff --git a/chapter/8/big-data.md b/chapter/8/big-data.md
index 12c3d54..0073cc2 100644
--- a/chapter/8/big-data.md
+++ b/chapter/8/big-data.md
@@ -1,7 +1,7 @@
---
layout: page
title: "Large Scale Parallel Data Processing"
-by: "Jingjing and Abhilash"
+by: "Jingjing and Abhilash Mysore Somashekar"
---
## Introduction
The growth of Internet has generated the so-called big data(terabytes or petabytes). It is not possible to fit them into a single machine or process them with one single program. Often the computation has to be done fast enough to provide practical services. A common approach taken by tech giants like Google, Yahoo, Facebook is to process big data across clusters of commodity machines. Many of the computations are conceptually straightforward, and Google proposed the MapReduce framework, which separates the programming logic and underlying execution details(data distribution, fault tolerance and scheduling). The model has been proved to be simple and powerful, and from then on, the idea inspired many other programming models.