4 ms·
These results are really cool because first when you look at such a problem space, the size may look insurmountable but with clever algorithms one can always h
by kyberias 13y ago
These results are really cool because first when you look at such a problem space, the size may look insurmountable but with clever algorithms one can always hope to solve it in reasonable time. Whether 35 CPU years is reasonable, I don't know. :)
- nathancahill 13y agoIt's not. But if you've been donated the spare cycles, it's easier to use them than to spend time optimizing a difficult algorithm. I wonder why Google donated spare cycles to solve the Rubik's cube when there are problems like Fold.it that could use it for science.
- kyberias 13y agoThat's a valid question. Although I didn't appreciate fold.it that much since the software crashed immediately when I tried it.
- existencebox 13y agoProbably? (jadedly) It's a cheap one off that earns them a lot of free publicity. Folding and SETI have been at it for decades, and will be for decades more. That'd be a lot of power/hardware costs for little net gain modulo time spent. (Note: 30 cpu years really isn't a lot of time when you start getting truly massive parallelism, and google is certainly at that scale. I'm honestly surprised to see this is pthreads based, I would have expected it to lean heavily on CUDA (or maybe I'm just showing my naivete to the field of parallel programming))
- nathancahill 13y agoCUDA is for GPUs (specifically NVIDIA GPUs). This is CPU processing. Pthreads is the way to go.
- birken 13y agoJust to put some numbers behind this: 35 CPU years = 35 * 365 = 12,775 CPU days Let's assume that your standard Google machine has 2 8-core processors, that is 16 cores per machine 12,775 / 16 = 798 machines 800 machines is a lot for your average person, but for a company like Google it is a very small drop in the bucket. And that is assuming you need to do all of the calculations in one day. If you are willing to do the calculations over a month, you only need 26 machines. Even if "CPU year" applies to one 8-core processor, that still means it is just 26 * 8 = 416 machines, which is a very small number for Google. And remember, the machines are still doing other things, this is just using idle CPU (generally a plentiful resource for your standard internet giant workload).
- largote 13y agoIt would seem to me that this kind of program would be heavily reliant on branching for which Vector processing (which is what GPUs excel at) is not the best choice.
- lotsofmangos 13y agoProbably for more or less the same reason that you are using your computer to chat online, rather than dedicating all of its cpu cycles for science.
- jotux 13y ago>I wonder why Google donated spare cycles to solve the Rubik's cube when there are problems like Fold.it that could use it for science. An equally absurd question: Why doesn't google use all of it's man/computing power for science instead of trying to make money from internet ads?
- nathancahill 13y agoSo you're implying that donating cycles to solve the Rubik's cube is making them money?
- jotux 13y agoI don't see how my comment implied that, at all.
- bitJericho 13y agoBut yes, yes it did.
- marssaxman 13y agoGoogle has also donated cycles to at least one scientist working on the protein folding problem; he's a friend of mine, and also happens to be a fan of the Rubik's cube.
- thaumasiotes 13y agoBecause it's cool. One day someone will turn lead into gold. There will never be a "good" reason to do that, but the history behind it is sufficient. There's nothing wrong with taking some pride in accomplishing something you've always wanted to do. The idea that someone somewhere should pick a goal and then all the resources anyone could conceivably spare must be devoted to it, on pain of a designation of "immoral", is a little more disturbing to me.
- ericvp 13y agoOther researchers did a similar thing to prove that a sudoku puzzle needs at least 17 clues to make a unique grid. They went from 6.7E21 possible grids to check, to 5.4E9 possible grids to check. http://www.youtube.com/watch?v=MlyTq-xVkQE http://www.youtube.com/watch?v=MlyTq-xVkQE