3 ms·
His problem is that you need an O(n^2) or higher algorithm to really see the advantages. Something like the n-body problem will go much, much faster on the GPU
by neutronicus 15y ago
His problem is that you need an O(n^2) or higher algorithm to really see the advantages. Something like the n-body problem will go much, much faster on the GPU than on the CPU for large n.
- drmajormccheese 15y agoThere have been some GPU implementations of the Barnes-Hut algorithm [O(nlogn) n-body problem].
- neutronicus 15y agoHow do they do against CPU implementations of same? I imagine you've really got to know what you're doing to compete, because that seems like a pretty branchy algorithm.