출처: http://en.wikipedia.org/wiki/Mapreduce
"Map" step: The master node takes the input, divides it into smaller sub-problems, and distributes them to worker nodes. A worker node may do this again in turn, leading to a multi-level tree structure. The worker node processes the smaller problem, and passes the answer back to its master node.
"Reduce" step: The master node then collects the answers to all the sub-problems and combines them in some way to form the output – the answer to the problem it was originally trying to solve.
한장의 그림으로 요약하는 MapReduce
출처: http://www.searchworkings.org/blog/-/blogs/introduction-to-hadoop/
'Archive' 카테고리의 다른 글
Average-case Analysis vs Amortized Analysis (0) | 2012.07.29 |
---|---|
Binary Heap vs Binomial Heap vs Fibonacci Heap vs Paring Heap vs Brodal Queue (0) | 2012.06.23 |
지나친 테스트 (0) | 2012.06.16 |
테스트에 친숙한 개발 (0) | 2012.06.16 |
자기 주변에 있는 라이브러리에 친숙해져라 (0) | 2012.06.16 |