Scribd
Upload
615 views1 page

Map Reduce Peer Graded

The document outlines the steps for a MapReduce job with 4 data partitions. It first maps and shuffles the data, sorting and grouping keys and values. It then reduces and stores the output across 8 partitions in HDFS.

Uploaded by

Navdeep Parewa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
615 views1 page

Map Reduce Peer Graded

The document outlines the steps for a MapReduce job with 4 data partitions. It first maps and shuffles the data, sorting and grouping keys and values. It then reduces and stores the output across 8 partitions in HDFS.

Uploaded by

Navdeep Parewa
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

STEP 0 –

1 - MAP 2 – SHUFFLE 3 - REDUCE


STORE TO
and SORT
HDFS
Assume 4 data
partitions. ( , 2 ) ( , 2 )
( , 2 ) ( , 8 )
( , 1 ) ( , 3 )
( , 1 ) ( , 1 ) ( , 4 )
( , 2 ) ( , 5 )
( , 3 )
( , 4 )
( , 2 ) ( , 2 )
( , 2 ) ( , 3 )
( , 1 )
( , 1 )
( , 1 ) ( , 2 )
( , 2 ) ( , 2 )
( , 2 )
( , 1 ) ( , 1 )
( , 2 )
( , 2 ) ( , 1 )
( , 2 ) ( , 1 )
( , 1 ) ( , 1 )
( , 1 ) ( , 1 )

You might also like