This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: 1 and A 1250, a and R2 will process all records with A 1251 and A 2500. In this scenario, how many records will be shued from a Mapper node to a Reducer node in the most ecient MapReduce execution? 1 2499 4997 2499 4997 2499 4998 2499 4998 2500 4999 2500 4999 2500 5000 2500 5000 . . . . x 2x1 x 2x1 x 2x x 2x A B For x in 1,2,3,. ..,2499,2500 representation of records in R Algebraic 1 1 1 1 1 2 1 2 2 3 2 3 2 4 2 4 A B Records in R R has a total of T(R)=10000 records Figure 1: Figure showing the contents of records in R Mapper M9 Records with Reducer R1 1 <= A <= 1250 Mapper M1 Records with 1 <= A <= 250 Records with Mapper M2 251 <= A <= 500 Records with 2001 <= A <= 2250 Mapper M10 2251 <= A <= 2500 Records with 1251 <= A <= 2500 Records with Reducer R2 Figure 2: Figure showing the 10 mappers M1M10 and 2 reducers R1R2 2...
View
Full
Document
This document was uploaded on 01/17/2012.
 Summer '09

Click to edit the document details