6 Dean Google
Upcoming SlideShare
Loading in...5
×
 

6 Dean Google

on

  • 2,469 views

google系统架构pdf

google系统架构pdf

Statistics

Views

Total Views
2,469
Views on SlideShare
2,435
Embed Views
34

Actions

Likes
11
Downloads
129
Comments
0

2 Embeds 34

http://heeha.wordpress.com 33
http://www.slideshare.net 1

Accessibility

Upload Details

Uploaded via as Adobe PDF

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

6 Dean Google 6 Dean Google Presentation Transcript

  • Handling Large Datasets at Google: Current Systems and Future Directions Jeff Dean Google Fellow http://labs.google.com/people/jeff
  • Outline • Hardware infrastructure • Distributed systems infrastructure: – Scheduling system – GFS – BigTable – MapReduce • Challenges and Future Directions – Infrastructure that spans all datacenters – More automation
  • Sample Problem Domains • Offline batch jobs – Large datasets (PBs), bulk reads/writes (MB chunks) – Short outages acceptable – Web indexing, log processing, satellite imagery, etc. • Online applications – Smaller datasets (TBs), small reads/writes small (KBs) – Outages immediately visible to users, low latency vital – Web search, Orkut, GMail, Google Docs, etc. • Many areas: IR, machine learning, image/video processing, NLP, machine translation, ...
  • Typical New Engineer • Never seen a petabyte of data • Never used a thousand machines • Never really experienced machine failure Our software has to make them successful.
  • Google’s Hardware Philosophy Truckloads of low-cost machines • Workloads are large and easily parallelized • Care about perf/$, not absolute machine perf • Even reliable hardware fails at our scale • Many datacenters, all around the world – Intra-DC bandwidth >> Inter-DC bandwidth – Speed of light has remained fixed in last 10 yrs :)
  • Effects of Hardware Philosophy • Software must tolerate failure • Application’s particular machine should not matter • No special machines - just 2 or 3 flavors Google - 1999
  • Current Design • In-house rack design • PC-class motherboards • Low-end storage and networking hardware • Linux • + in-house software
  • The Joys of Real Hardware Typical first year for a new cluster: ~0.5 overheating (power down most machines in <5 mins, ~1-2 days to recover) ~1 PDU failure (~500-1000 machines suddenly disappear, ~6 hours to come back) ~1 rack-move (plenty of warning, ~500-1000 machines powered down, ~6 hours) ~1 network rewiring (rolling ~5% of machines down over 2-day span) ~20 rack failures (40-80 machines instantly disappear, 1-6 hours to get back) ~5 racks go wonky (40-80 machines see 50% packet loss) ~8 network maintenances (4 might cause ~30-minute random connectivity losses) ~12 router reloads (takes out DNS and external vips for a couple minutes) ~3 router failures (have to immediately pull traffic for an hour) ~dozens of minor 30-second blips for dns ~1000 individual machine failures ~thousands of hard drive failures slow disks, bad memory, misconfigured machines, flaky machines, etc.
  • Typical Cluster Machine 1 Machine 2 Machine N … Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • Typical Cluster Cluster scheduling master Chubby Lock service GFS master Machine 1 Machine 2 Machine N … Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • Typical Cluster Cluster scheduling master Chubby Lock service GFS master Machine 1 Machine 2 Machine N User app1 User … app1 Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • Typical Cluster Cluster scheduling master Chubby Lock service GFS master Machine 1 Machine 2 Machine N User app1 User … User app2 app1 Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • Typical Cluster Cluster scheduling master Chubby Lock service GFS master Machine 1 Machine 2 Machine N User app1 BigTable BigTable server server User … User app2 app1 Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • Typical Cluster Cluster scheduling master Chubby Lock service GFS master Machine 1 Machine 2 Machine N User app1 BigTable BigTable BigTable master server server User … User app2 app1 Scheduler Scheduler Scheduler GFS GFS GFS slave slave slave chunkserver chunkserver chunkserver Linux Linux Linux
  • File Storage: GFS Client GFS Master Client Client C1 C1 C0 C5 C0 … C2 C3 C5 C2 C5 Chunkserver 2 Chunkserver N Chunkserver 1 • Master: Manages file metadata • Chunkserver: Manages 64MB file chunks • Clients talk to master to open and find files • Clients talk directly to chunkservers for data
  • GFS Usage • 200+ GFS clusters • Managed by an internal service team • Largest clusters – 5000+ machines – 5+ PB of disk usage – 10000+ clients
  • Data Storage: BigTable What is it, really? • 10-ft view: Row & column abstraction for storing data • Reality: Distributed, persistent, multi-level sorted map
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value Rows “www.cnn.com”
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value “contents:” Columns Rows “www.cnn.com”
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value “contents:” Columns Rows “www.cnn.com” “<html>…”
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value “contents:” Columns Rows “www.cnn.com” t17 “<html>…” Timestamps
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value “contents:” Columns Rows t11 “www.cnn.com” t17 “<html>…” Timestamps
  • BigTable Data Model • Multi-dimensional sparse sorted map (row, column, timestamp) => value “contents:” Columns Rows t3 t11 “www.cnn.com” t17 “<html>…” Timestamps
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Tablets (cont.) “language:” “contents:” “aaa.com” “cnn.com” EN “<html>…” “cnn.com/sports.html” Tablets “website.com” … … “yahoo.com/kids.html” “yahoo.com/kids.html” … “zuppa.com/menu.html”
  • Bigtable System Structure Bigtable Cell Bigtable master Bigtable tablet server … Bigtable tablet server Bigtable tablet server
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service handles failover, monitoring
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service handles failover, monitoring holds tablet data, logs
  • Bigtable System Structure Bigtable Cell Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service holds metadata, handles failover, monitoring holds tablet data, logs handles master-election
  • Bigtable System Structure Bigtable client Bigtable Cell Bigtable client library Bigtable master performs metadata ops + load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service holds metadata, handles failover, monitoring holds tablet data, logs handles master-election
  • Bigtable System Structure Bigtable client Bigtable Cell Bigtable client library Bigtable master performs metadata ops + Open() load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service holds metadata, handles failover, monitoring holds tablet data, logs handles master-election
  • Bigtable System Structure Bigtable client Bigtable Cell Bigtable client library Bigtable master performs metadata ops + Open() read/write load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service holds metadata, handles failover, monitoring holds tablet data, logs handles master-election
  • Bigtable System Structure Bigtable client Bigtable Cell Bigtable client metadata ops library Bigtable master performs metadata ops + Open() read/write load balancing Bigtable tablet server … Bigtable tablet server Bigtable tablet server serves data serves data serves data Cluster scheduling system GFS Lock service holds metadata, handles failover, monitoring holds tablet data, logs handles master-election
  • Some BigTable Features • Single-row transactions: easy to do read/modify/write operations • Locality groups: segregate columns into different files • In-memory columns: random access to small items • Suite of compression techniques: per-locality group • Bloom filters: avoid seeks for non-existent data • Replication: eventual-consistency replication across datacenters, between multiple BigTable serving setups (master/slave & multi-master)
  • BigTable Usage • 500+ BigTable cells • Largest cells manage 6000TB+ of data, 3000+ machines • Busiest cells sustain >500000+ ops/ second 24 hours/day, and peak much higher
  • Data Processing: MapReduce • Google’s batch processing tool of choice • Users write two functions: – Map: Produces (key, value) pairs from input – Reduce: Merges (key, value) pairs from Map • Library handles data transfer and failures • Used everywhere: Earth, News, Analytics, Search Quality, Indexing, …
  • Example: Document Indexing • Input: Set of documents D1, …, DN • Map – Parse document D into terms T1, …, TN – Produces (key, value) pairs • (T1, D), …, (TN, D) • Reduce – Receives list of (key, value) pairs for term T • (T, D1), …, (T, DN) – Emits single (key, value) pair • (T, (D1, …, DN))
  • MapReduce Execution MapReduce GFS master Map task 1 Map task 2 Map task 3 map map map k1:v k2:v k1:v k3:v k1:v k4:v Shuffle and Sort Reduce task 1 Reduce task 2 k1:v,v,v k3,v k2:v k4,v reduce reduce GFS
  • MapReduce Tricks / Features • • Data locality Backup copies of tasks • # tasks >> # machines • Multiple I/O data types • Task re-execution on failure • Data compression • Local or cluster execution • Pipelined shuffle stage • Distributed counters • Fast sorter 21
  • MapReduce Programs in Google’s Source Tree 12500 10000 7500 5000 2500 0 Jan-03 May-03 Sep-03 Jan-04 May-04 Sep-04 Jan-05 May-05 Sep-05 Jan-06 May-06 Sep-06 Jan-07 May-07 Sep-07 22
  • New MapReduce Programs Per Month 700 525 350 175 0 Jan-03 May-03 Sep-03 Jan-04 May-04 Sep-04 Jan-05 May-05 Sep-05 Jan-06 May-06 Sep-06 Jan-07 May-07 Sep-07 23
  • New MapReduce Programs Per Month Summer intern effect 700 525 350 175 0 Jan-03 May-03 Sep-03 Jan-04 May-04 Sep-04 Jan-05 May-05 Sep-05 Jan-06 May-06 Sep-06 Jan-07 May-07 Sep-07 23
  • MapReduce in Google Easy to use. Library hides complexity. Mar, ‘05 Mar, ‘06 Sep, '07 Number of jobs 72K 171K 2,217K Average time (seconds) 934 874 395 Machine years used 981 2,002 11,081 Input data read (TB) 12,571 52,254 403,152 Intermediate data (TB) 2,756 6,743 34,774 Output data written (TB) 941 2,970 14,018 Average worker machines 232 268 394
  • Current Work Scheduling system + GFS + BigTable + MapReduce work well within single clusters Many separate instances in different data centers – Tools on top deal with cross-cluster issues – Each tool solves relatively narrow problem – Many tools => lots of complexity Can next generation infrastructure do more?
  • Next Generation Infrastructure Truly global systems to span all our datacenters • Global namespace with many replicas of data worldwide • Support both consistent and inconsistent operations • Continued operation even with datacenter partitions • Users specify high-level desires: “99%ile latency for accessing this data should be <50ms” “Store this data on at least 2 disks in EU, 2 in U.S. & 1 in Asia” – Increased utilization through automation – Automatic migration, growing and shrinking of services – Lower end-user latency – Provide high-level programming model for data-intensive interactive services
  • Questions? Further info: • The Google File System, Sanjay Ghemawat, Howard Gobioff, Shun-Tak Leung, SOSP ‘03. • Web Search for a Planet: The Google Cluster Architecture, Luiz Andre Barroso, Jeffrey Dean, Urs Hölzle, IEEE Micro, 2003. • Bigtable: A Distributed Storage System for Structured Data, Fay Chang, Jeffrey Dean, Sanjay Ghemawat, Wilson C. Hsieh, Deborah A. Wallach, Mike Burrows, Tushar Chandra, Andrew Fikes, Robert E. Gruber, OSDI’06 • MapReduce: Simplified Data Processing on Large Clusters, Jeffrey Dean and Sanjay Ghemawat, OSDIʼ04 • Failure Trends in a Large Disk Drive Population, Eduardo Pinheiro, Wolf- Dietrich Weber and Luiz André Barroso. FAST, ‘07. http://labs.google.com/papers http://labs.google.com/people/jeff or jeff@google.com