- Mastering Hadoop
- Sandeep Karanth
- 405字
- 2021-08-06 19:52:59
Chapter 2. Advanced MapReduce
MapReduce is a programming model for parallel and distributed processing of data. It consists of two steps: Map and Reduce. These steps are inspired from functional programming, a branch of computer science that deals with mathematical functions as computational units. Properties of functions such as immutability and statelessness are attractive for parallel and distributed processing. They provide a high degree of parallelism and fault tolerance at lower costs and semantic complexity.
In this chapter, we will look at advanced optimizations when running MapReduce jobs on Hadoop clusters. Every MapReduce job has input data and a Map task per split of this data. The Map task calls a map
function repeatedly on every record, represented as a key-value pair. The map
is a function that transforms data from one domain to another. The intermediate output records of each Map task are shuffled and sorted before transferring it downstream to the Reduce tasks. Intermediate data with the same keys go to the same Reduce task. The Reduce task calls the reduce
function for a key and all its associated values. Outputs are then collected and stored.
The Map step has the greatest degree of parallelism. It is used to implement operations such as filtering, sorting, and transformations on data. The Reduce step is used to implement summarization operations on data. Hadoop also provides features such as DistributedCache as a side channel to distribute data and Counters to collect job-related global statistics. We will be looking at their utility in processing MapReduce jobs.
The advanced features and optimizations will be explained with the help of examples of code. Hadoop 2.2.0 will be used throughout this chapter. It is assumed that you have access to the Java development environment and a Hadoop cluster, either in your organization, the cloud, or as a standalone/pseudo-distributed mode installation on your personal computers. You need to have knowledge on how to compile Java programs and run Hadoop jobs to try out the examples.
In this chapter, we will look at the following topics:
- The different phases of a MapReduce job and the optimizations that can be applied at each phase. The input, Map, Shuffle/Sort, Reduce, and the output phases will be covered in depth with relevant examples.
- The application of useful Hadoop features such as DistributedCache and Counters.
- The types of data joins that can be achieved in a MapReduce job and the patterns to achieve them.
- 火格局的時空變異及其在電網防火中的應用
- 空間機器人遙操作系統及控制
- 程序設計缺陷分析與實踐
- INSTANT Varnish Cache How-to
- Cloudera Administration Handbook
- 運動控制器與交流伺服系統的調試和應用
- 觸控顯示技術
- 具比例時滯遞歸神經網絡的穩定性及其仿真與應用
- 內模控制及其應用
- PVCBOT機器人控制技術入門
- Dreamweaver CS6精彩網頁制作與網站建設
- 深度學習與目標檢測
- Hands-On Data Warehousing with Azure Data Factory
- Visual Studio 2010 (C#) Windows數據庫項目開發
- 生物3D打印:從醫療輔具制造到細胞打印