ee324 distributed systems fall 2015 mapreduce. overview 2 mapreduce
DESCRIPTION
Lots of data… how do you extract what you need? Example 1: Want to extract out terms from a bunch of files and keep an index Input:, Output: list of files containing and the offsets of Example 2: Reverse index Input: Output: For each, A, a list of ’s that has a reference to A.TRANSCRIPT
![Page 1: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/1.jpg)
EE324 DISTRIBUTED SYS-TEMSFALL 2015
MapReduce
![Page 2: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/2.jpg)
2
Overview
MapReduce
![Page 3: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/3.jpg)
Lots of data… how do you extract what you need?
Example 1: Want to extract out terms from a bunch of files and keep an index
Input: <search term>, <files>Output: list of files containing <search
term> and the offsets of <search term> Example 2: Reverse indexInput: <web objects>Output: For each <web object>, A, a list of <web object>’s that has a reference to A.
![Page 4: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/4.jpg)
MapReduce An abstraction and system for large-
scale, data-intensive computation
Reading MapReduce: Simplified Data Processing on
Large Clusters [OSDI2004]http://www.stanford.edu/class/cs240/readings/dean.pdf
![Page 5: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/5.jpg)
5
MapReduce Programming model + infrastructure Write programs that run on lots of ma-
chines Automatic parallelization and distribution Fault-tolerance Scheduling, status and monitoring
![Page 6: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/6.jpg)
6
MapReduce Programming Model
Input & Output: sets of <key, value> pairs Programmer writes 2 functions:map (in_key, in_value) list(out_key, intermediate_value) Processes <k,v> pairs Produces intermediate pairs
reduce (out_key, list(interm_val)) list(out_value)
Combines intermediate values for a key Produces a merged set of outputs (may be also
<k,v> pairs)
![Page 7: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/7.jpg)
7
Example: Counting Words…map(String input_key, String input_value): // input_key: document name // input_value: document contents
for each word w in input_value: EmitIntermediate(w, "1");
reduce(String output_key, Iterator intermediate_values): // output_key: a word // output_values: a list of counts
int result = 0; for each v in intermediate_values:
result += ParseInt(v); Emit(AsString(result));
MapReduce handles all the other details!
![Page 8: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/8.jpg)
8MapReduce: Example
![Page 9: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/9.jpg)
9
MapReduce in Parallel: Example
![Page 10: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/10.jpg)
10
MapReduce: Execution overview
![Page 11: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/11.jpg)
11
MapReduce: Refinements Locality Optimization
Leverage GFS to schedule a map task on a machine that contains a replica of the cor-responding input data.
Thousands of machines read input at local disk speed
Without this, rack switches limit read rate
![Page 12: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/12.jpg)
12
MapReduce: Refinements Redundant Exe-cution
Slow workers are source of bottleneck, may delay completion time.
Near end of phase, spawn backup tasks, one to finish first wins.
Effectively utilizes computing power, re-ducing job completion time by a factor.
![Page 13: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/13.jpg)
13
MapReduce: Refinements Skipping Bad Records
Map/Reduce functions sometimes fail for particu-lar inputs.
Fixing the bug might not be possible : Third Party Libraries.
On Error Worker sends signal to Master If multiple error on same record, skip record
![Page 14: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/14.jpg)
14
Take Home Messages
Although restrictive, provides good fit for many problems encountered in the practice of processing large data sets.
Functional Programming Paradigm can be applied to large scale computation.
Easy to use, hides messy details of parallelization, fault-tolerance, data distribution and load balancing from the programmers.
And finally, if it works for Google, it should be handy !!
![Page 15: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/15.jpg)
15
Overview
MapReduce
BigTable
![Page 16: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/16.jpg)
16
BigTable Distributed storage system for managing
structured data. Designed to scale to a very large size
Petabytes of data across thousands of servers Used for many Google projects
Web indexing, Personalized Search, Google Earth, Google Analytics, Google Finance, …
Flexible, high-performance solution for all of Google’s products
![Page 17: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/17.jpg)
17
Motivation Lots of (semi-)structured data at Google
URLs: Contents, crawl metadata, links, anchors, pagerank, …
Per-user data: User preference settings, recent queries/search re-
sults, … Geographic locations:
Physical entities (shops, restaurants, etc.), roads, satel-lite image data, user annotations, …
Scale is large Billions of URLs, many versions/page (~20K/
version) Hundreds of millions of users, thousands or q/
sec 100TB+ of satellite image data
![Page 18: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/18.jpg)
18
Why not just use commercial DB?
Scale is too large for most commercial databases
Even if it weren’t, cost would be very high Building internally means system can be applied
across many projects for low incremental cost Low-level storage optimizations help per-
formance significantly Much harder to do when running on top of a
database layer
![Page 19: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/19.jpg)
19
Goals Want asynchronous processes to be continu-
ously updating different pieces of data Want access to most current data at any time
Need to support: Very high read/write rates (millions of ops per sec-
ond) Efficient scans over all or interesting subsets of data Efficient joins of large one-to-one and one-to-many
datasets Often want to examine data changes over time
E.g. Contents of a web page over multiple crawls
![Page 20: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/20.jpg)
20
BigTable Distributed multi-dimensional map Fault-tolerant, persistent Scalable
Thousands of servers Terabytes of in-memory data Petabyte of disk-based data Millions of reads/writes per second, efficient
scans Self-managing
Servers can be added/removed dynamically Servers adjust to load imbalance
![Page 21: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/21.jpg)
21
Building Blocks Building blocks:
Google File System (GFS): Raw storage Scheduler: schedules jobs onto machines Lock service: distributed lock manager MapReduce: simplified large-scale data pro-
cessing BigTable uses of building blocks:
GFS: stores persistent data (SSTable file format for storage of data)
Scheduler: schedules jobs involved in BigTable serving
Lock service: master election, location boot-strapping
Map Reduce: often used to read/write BigTable data
![Page 22: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/22.jpg)
22
Basic Data Model A BigTable is a sparse, distributed persis-
tent multi-dimensional sorted map(row, column, timestamp) -> cell contents
Good match for most Google applications
![Page 23: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/23.jpg)
23
WebTable Example
Want to keep copy of a large collection of web pages and related information
Use URLs as row keys Various aspects of web page as column names Store contents of web pages in the contents: column
under the timestamps when they were fetched.
![Page 24: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/24.jpg)
24
Rows
Name is an arbitrary string Access to data in a row is atomic Row creation is implicit upon storing data
Rows ordered lexicographically Rows close together lexicographically usually
on one or a small number of machines
![Page 25: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/25.jpg)
25
Rows (cont.) Reads of short row ranges are efficient and typ-
ically require communication with a small number of machines.
Can exploit this property by selecting row keys so they get good locality for data access.
Example: math.gatech.edu, math.uga.edu, phys.gatech.edu, phys.uga.edu VS edu.gatech.math, edu.gatech.phys, edu.uga.math, edu.uga.phys
![Page 26: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/26.jpg)
26
Columns
Columns have two-level name structure: family:optional_qualifier
Column family Unit of access control Has associated type information
Qualifier gives unbounded columns Additional levels of indexing, if desired
![Page 27: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/27.jpg)
27
Timestamps
Used to store different versions of data in a cell New writes default to current time, but timestamps for writes can
also be set explicitly by clients Lookup options:
“Return most recent K values” “Return all values in timestamp range (or all values)”
Column families can be marked w/ attributes: “Only retain most recent K values in a cell” “Keep values until they are older than K seconds”
![Page 28: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/28.jpg)
28
Implementation – Three Major Compo-nents Library linked into every client One master server
Responsible for: Assigning tablets to tablet servers Detecting addition and expiration of tablet servers Balancing tablet-server load Garbage collection
Many tablet servers Tablet servers handle read and write requests
to its table Splits tablets that have grown too large
![Page 29: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/29.jpg)
29
Implementation (cont.) Client data doesn’t move through master
server. Clients communicate directly with tablet servers for reads and writes.
Most clients never communicate with the master server, leaving it lightly loaded in practice. METADATA table has the location of all the
tablets
![Page 30: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/30.jpg)
30
Tablets Large tables broken into tablets at row
boundaries Tablet holds contiguous range of rows
Clients can often choose row keys to achieve locality Aim for ~100MB to 200MB of data per tablet
Serving machine responsible for ~100 tablets Fast recovery:
100 machines each pick up 1 tablet for failed machine Fine-grained load balancing:
Migrate tablets away from overloaded machine Master makes load-balancing decisions
![Page 31: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/31.jpg)
31
SSTable Immutable, sorted file of key-
value pairs Chunks of data plus an index
Index is of block ranges, not values
Index
64K block
64K block
64K block
SSTable
![Page 32: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/32.jpg)
32
Tablet Contains some range of rows of the table Built out of multiple SSTables
Index
64K block
64K block
64K block
SSTable
Index
64K block
64K block
64K block
SSTable
Tablet Start:aardvark End:apple
![Page 33: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/33.jpg)
33
Table Multiple tablets make up the table SSTables can be shared Tablets do not overlap, SSTables can overlap
SSTable SSTable SSTable SSTable
Tabletaardvark apple
Tabletapple_two_E boat
![Page 34: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/34.jpg)
34
Tablet Location Since tablets move around from server
to server, given a row, how do clients find the right machine? Need to find tablet whose row range covers
the target row
![Page 35: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/35.jpg)
35
Chubby {lock/file/name} service Coarse-grained locks, can store small
amount of data in a lock 5 replicas, need a majority vote to be ac-
tive Also an OSDI ’06 Paper
![Page 36: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/36.jpg)
36
Servers Tablet servers manage tablets, multiple
tablets per server. Each tablet is 100-200 MB Each tablet lives at only one server Tablet server splits tablets that get too big
Master responsible for load balancing and fault tolerance
![Page 37: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/37.jpg)
37
Editing a table Mutations are logged, then applied to an in-memory
memtable May contain “deletion” entries to handle updates Group commit on log: collect multiple updates before log flush
SSTable SSTable
Tablet
apple_two_E boat
Insert
InsertDelete
InsertDelete
Insert
Memtable
tabl
et lo
g
GFS
Memory
![Page 38: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/38.jpg)
38
Compactions Minor compaction – convert the memtable into
an SSTable Reduce memory usage Reduce log traffic on restart
Merging compaction Reduce number of SSTables (Every minor com-
paction creats a new SST.) Good place to apply policy “keep only N versions”
Major compaction Merging compaction that results in only one SSTable No deletion records, only live data
![Page 39: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/39.jpg)
39
Master’s Tasks Use Chubby to monitor health of tablet
servers, restart failed servers Tablet server registers itself by getting a lock in a
specific directory chubby Chubby gives “lease” on lock, must be renewed periodically Server loses lock if it gets disconnected
Master monitors this directory to find which servers exist/are alive If server not contactable/has lost lock, master grabs lock
and reassigns tablets GFS replicates data. Prefer to start tablet server on same
machine that the data is already at
![Page 40: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/40.jpg)
40
Master’s Tasks (Cont) When (new) master starts
grabs master lock on chubby Ensures only one master at a time
Finds live servers (scan chubby directory) Communicates with servers to find as-
signed tablets Scans metadata table to find all tablets
Keeps track of unassigned tablets, assigns them
Metadata root from chubby, other metadata tablets assigned before scanning.
![Page 41: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/41.jpg)
41
Tablet Assignment Each tablet is assigned to one tablet
server at a time. Master server keeps track of the set of
live tablet servers and current assign-ments of tablets to servers. Also keeps track of unassigned tablets.
When a tablet is unassigned, master as-signs the tablet to an tablet server with sufficient room.
![Page 42: EE324 DISTRIBUTED SYSTEMS FALL 2015 MapReduce. Overview 2 MapReduce](https://reader036.vdocuments.mx/reader036/viewer/2022062317/5a4d1b1d7f8b9ab059993ed3/html5/thumbnails/42.jpg)
Summary MapReduce: a nice abstraction GFS, MapReduce, BigTable, Chubby: all
interact with each other to provide a “service”/infrastructure
Hadoop http://hadoop.apache.org/