Question: In the MapReduce framework, for performing a parallel computation, a crucial step involves an input that consists of a set of n key-value pairs, (k,
In the MapReduce framework, for performing a parallel computation, a crucial step involves an input that consists of a set of n key-value pairs, (k, v), for which we need to collect each subset of key-value pairs that have the same key, k, into a single file. Describe an efficient external-memory algorithm for constructing all such files. How many disk transfers does your algorithm perform?
Step by Step Solution
3.33 Rating (168 Votes )
There are 3 Steps involved in it
Sort the elements of S using an externalmemory sorting algorithm This ... View full answer
Get step-by-step solutions from verified subject matter experts
