Can sorting be compared to matrix computation?
"There is no computer on Earth that could possibly store such a big matrix in its memory"
On the other Google says that they sorted "1PB (10 trillion 100-byte records) on 4,000 computers" in six hours.
I know one is talking about matrix computation the other sorting. But is there a way to compare these two to verify if what the physicist claims is wrong and that google could actually store and make that computation?
Thanks
http://www.newscientist.com/article/dn16095-its-confirmed-matter-is-merely-vacuum-fluctuations.html
Virtual quarks make the calculations much more complicated, involving a matrix of more than 10,000 trillion numbers, says Stephan Dürr of the John von Neumann Institute for Computing in Jülich, Germany, who led the team.
"There is no computer on Earth that could possibly store such a big matrix in its memory," Dürr told New Scientist, "so some trickery goes into evaluating it."
http://googleblog.blogspot.com/2008/11/sorting-1pb-with-mapreduce.html
It took six hours and two minutes to sort 1PB (10 trillion 100-byte records) on 4,000 computers.
2 comments
[ 3.2 ms ] story [ 17.6 ms ] threadDell do blade servers with 192 GB RAM. Call it 200 GB, which is 2e11 bytes.
You'd need 8e16/2e11 = 4e5 = 400,000 of them. At £35k each that's 14 billion quid. (Though with that big an order, you could no doubt build or get them cheaper). This is about gross world output for 4 hours. So it's doable, but not on the budget that most organisations could afford.