超大集群的简单数据处理.ppt

How is this distributed? Partition input key/value pairs into chunks, run map() tasks in parallel After all map()s are complete, consolidate all emitted values for each unique emitted key Now partition space of output map keys, and run reduce() in parallel If map() or reduce() fails, reexecute! —Jeffrey Dean and Sanjay Ghemawat 制作人：郑雅洁 2015.10.31 Jeff?Dean，Google的软件架构天才。Google大型并发编程框架