Question

Suppose we execute the word-count mapreduce program described in this section on a large repository such as a copy of the web. We shall use 100 map tasks and some number of reduce tasks. (a) suppose we do not use a combiner at the map tasks. Do you expect there to be signicant skew in the times taken by the various reducers to process their value list? Why or why not? (b) if we combine the reducers into a small number of reduce tasks, say 10 tasks, at random, do you expect the skew to be signicant? What if we instead combine the reducers into 10,000 reduce tasks? ! (c) suppose we do use a combiner at the 100 map tasks. Do you expect skew to be signicant? Why or why not

Answer 1

this is the answer of your question .