Google三驾马车：GFS、MapReduce和Bigtable

秒速五厘米 2022-06-07 07:36 232阅读 0赞

MapReduce、GFS和BigTable的论文都已经被翻译成高质量的中文，  
 为了方便大家整理，我把三篇论文的地址统一列在这里：  
MapReduce：  
http://blog.csdn.net/active1001/archive/2007/07/02/1675920.aspx

GFS:  
http://blog.csdn.net/xuleicsu/archive/2005/11/10/526386.aspx

BigTale:  
http://blog.csdn.net/accesine960/archive/2006/02/09/595628.aspx

原文地址链接：

[http://labs.google.com/papers/gfs.html][http_labs.google.com_papers_gfs.html]

[http://labs.google.com/papers/bigtable.html][http_labs.google.com_papers_bigtable.html]

[http://labs.google.com/papers/mapreduce.html][http_labs.google.com_papers_mapreduce.html]

[  
][Link 1]

谈到分布式系统，就不得不提Google的三驾马车:Google FS MapReduce Bigtable

虽然Google没有公布这三个产品的源码，但是他发布了这三个产品的详细设计论文。而且，Yahoo资助的Hadoop也有按照这三篇论文的开源Java实现:Hadoop对应MapReduce, Hadoop Distributed File System (HDFS)对应Google FS,Hbase对应Bigtable。不过在性能上Hadoop比Google要差很多，参见表1。

表1：Hbase和BigTable性能比较(来源于http://wiki.apache.org/lucene-hadoop/Hbase/PerformanceEvaluation)

<table style="margin:0px; padding:0px; border-collapse:collapse; border-spacing:0px; border:1px solid silver; word-break:break-word; color:rgb(0,0,0); font-family:&quot;Comic Sans MS&quot;,微软雅黑; font-size:15px; height:345px; width:555px"> 
 <tbody style="margin:0px; padding:0px"> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> Experiment </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> HBase20070916 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> BigTable </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> random reads </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 272 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 1212 </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> random reads (mem) </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> Not implemented </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 10811 </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> random writes </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 1460 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 8850 </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> sequential reads </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 267 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 4425 </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> sequential writes </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 1278 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 8547 </td> 
 </tr> 
 <tr style="margin:0px; padding:0px"> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> Scans </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 3692 </td> 
 <td style="margin:0px; padding:3px; border:1px solid silver; border-collapse:collapse"> 15385 </td> 
 </tr> 
 </tbody> 
</table>

以下分别介绍这三个产品：

[回到顶部][Link 2]

### 1. Google FS ###

GFS是一个可扩展的分布式文件系统，用于大型的、分布式的、对大量数据进行访问的应用。它运行于廉价的普通硬件上，提供容错功能。

[　　][Link 3]

图1 GFS Architecture

（1）GFS的结构

1. GFS的结构图见图1，由一个master和大量的chunkserver构成，

2. 不像Amazon Dynamo的没有主的设计，Google设置一个主来保存目录和索引信息，这是为了简化系统结果，提高性能来考虑的，但是这就会造成主成为单点故障或者瓶颈。为了消除主的单点故障Google把每个chunk设置的很大(64M)，这样，由于代码访问数据的本地性，application端和master的交互会减少，而主要数据流量都是Application和chunkserver之间的访问。

3. 另外，master所有信息都存储在内存里,启动时信息从chunkserver中获取。提高了master的性能和吞吐量，也有利于master当掉后，很容易把后备j机器切换成master。

4. 客户端和chunkserver都不对文件数据单独做缓存，只是用linux文件系统自己的缓存

“The master stores three major types of metadata: the file and chunk namespaces, the mapping from files to chunks, and the locations of each chunk’s replicas.”

“Having a single master vastly simplifies our design and enables the master to make sophisticated chunk placement and replication decisions using global knowledge. However,we must minimize its involvement in reads and writes so that it does not become a bottleneck. Clients never read and write file data through the master. Instead, a client asks the master which chunkservers it should contact. It caches this information for a limited time and interacts with the chunkservers directly for many subsequent operations.”

“Neither the client nor the chunkserver caches file data.Client caches offer little benefit because most applications stream through huge files or have working sets too large to be cached. Not having them simplifies the client and the overall system by eliminating cache coherence issues.(Clients do cache metadata, however.) Chunkservers need not cache file data because chunks are stored as local files and so Linux’s buffer cache already keeps frequently accessed data in memory.”

（2）GFS的复制

GFS典型的复制到3台机器上，参看图2

图2 一次写操作的控制流和数据流

(3) 对外的接口

和文件系统类似，GFS对外提供create, delete,open, close, read, 和 write 操作。另外，GFS还新增了两个接口snapshot and record append，snapshot。有关snapshot的解释：

“Moreover, GFS has snapshot and record append operations. Snapshot creates a copy of a file or a directory tree at low cost.

Record append allows multiple clients to append data to the same file concurrently while guaranteeing the atomicity of each individual client’s append.”

[回到顶部][Link 2]

### 2. MapReduce ###

MapReduce是针对分布式并行计算的一套编程模型。

讲到并行计算，就不能不谈到微软的Herb Sutter在2005年发表的文章” The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software”\[6\]，主要意思是通过提高cpu主频的方式来提高程序的性能很快就要过去了，cpu的设计方向也主要是多核，超线程等并发上。但是以前的程序并不能自动的得到多核的好处，只有编写并发程序，才能真正获得多核的好处。分布式计算也是一样。

[　　][Link 4]

图3 MapReduce Execution overview

1）MapReduce是由Map和reduce组成,来自于Lisp，Map是影射，把指令分发到多个worker上去，Reduce是规约，把Map的worker计算出来的结果合并。（参见图3）

2）Google的MapReduce实现使用GFS存储数据。

3）MapReduce可用于Distributed Grep,Count of URL Access Frequency,ReverseWeb-Link Graph,Distributed Sort,Inverted Index

[回到顶部][Link 2]

### 3. Bigtable ###

就像文件系统需要数据库来存储结构化数据一样，GFS也需要Bigtable来存储结构化数据。

1）BigTable 是建立在 GFS ，Scheduler ，Lock Service 和 MapReduce 之上的。

2）每个Table都是一个多维的稀疏图

3）为了管理巨大的Table，把Table根据行分割，这些分割后的数据统称为：Tablets。每个Tablets大概有 100-200 MB，每个机器存储100个左右的 Tablets。底层的架构是：GFS。由于GFS是一种分布式的文件系统，采用Tablets的机制后，可以获得很好的负载均衡。比如：可以把经常响应的表移动到其他空闲机器上，然后快速重建。

[回到顶部][Link 2]

### 参考文献 ###

［1］The Google File System; [http://labs.google.com/papers/gfs-sosp2003.pdf][http_labs.google.com_papers_gfs-sosp2003.pdf]

［2］MapReduce: Simplifed Data Processing on Large Clusters; [http://labs.google.com/papers/mapreduce-osdi04.pdf][http_labs.google.com_papers_mapreduce-osdi04.pdf]

［3］Bigtable: A Distributed Storage System for Structured Data;[http://labs.google.com/papers/bigtable-osdi06.pdf][http_labs.google.com_papers_bigtable-osdi06.pdf]

［4］Hadoop ; [http://lucene.apache.org/hadoop/][http_lucene.apache.org_hadoop]

［5］Hbase: Bigtable-like structured storage for Hadoop HDFS;[http://wiki.apache.org/lucene-hadoop/Hbase][http_wiki.apache.org_lucene-hadoop_Hbase]

［6］The Free Lunch Is Over: A Fundamental Turn Toward Concurrency in Software;[http://www.gotw.ca/publications/concurrency-ddj.htm][http_www.gotw.ca_publications_concurrency-ddj.htm]

[http_labs.google.com_papers_gfs.html]: http://labs.google.com/papers/gfs.html
[http_labs.google.com_papers_bigtable.html]: http://labs.google.com/papers/bigtable.html
[http_labs.google.com_papers_mapreduce.html]: http://labs.google.com/papers/mapreduce.html
[Link 1]: http://blog.csdn.net/arlanhon/article/details/22983645#
[Link 2]: http://www.cnblogs.com/maybe2030/p/4568541.html#_labelTop
[Link 3]: http://photo.blog.sina.com.cn/showpic.html#blogid=4ed630e801000bi3&url=http://s2.sinaimg.cn/orignal/4ed630e8f6023a3260c91
[Link 4]: http://photo.blog.sina.com.cn/showpic.html#blogid=4ed630e801000bi3&url=http://s16.sinaimg.cn/orignal/4ed630e8572b6a6c0ceef
[http_labs.google.com_papers_gfs-sosp2003.pdf]: http://labs.google.com/papers/gfs-sosp2003.pdf
[http_labs.google.com_papers_mapreduce-osdi04.pdf]: http://labs.google.com/papers/mapreduce-osdi04.pdf
[http_labs.google.com_papers_bigtable-osdi06.pdf]: http://labs.google.com/papers/bigtable-osdi06.pdf
[http_lucene.apache.org_hadoop]: http://lucene.apache.org/hadoop/
[http_wiki.apache.org_lucene-hadoop_Hbase]: http://wiki.apache.org/lucene-hadoop/Hbase
[http_www.gotw.ca_publications_concurrency-ddj.htm]: http://www.gotw.ca/publications/concurrency-ddj.htm