Re:Official Google Blog: Sorting 1PB with MapReduce
by russell on Saturday November 22, 2008 @01:43PM
(#373063)
Sounds dead on to me. The typical sort is O(N logN). O can be slightly different between the 1T runs and 1P runs, e.g. slightly difference latency or pattern of disk failures. Every sort is sensitive to the data distribution. There is probably an interesting distribution of results across the runs.
[ Parent
| on HN ]
There are no comments on this comment yet.