Last year MapReduce received the first place at “TeraByte Sort Benchmark”. They used 910 nodes, every node with two cores, i.e.,  a total of 1820 cores and were able to store the entire data in memory across the nodes. By implementation of MapReduce they were able to arrange entire one terabyte of data in 209 seconds. Users program, i.e., map and reduce functions in ANSI C.

Leave a Reply

Your email address will not be published. Required fields are marked *

Solve : *
10 + 14 =