4 ms·
Dijkstra's shortest path. (IE: Pointer chasing). Goertzel's algorithm If you have a simple, straight through algorithm running on a few million datapoints. GPU
by spitfire 14y ago
Dijkstra's shortest path. (IE: Pointer chasing).
Goertzel's algorithm
If you have a simple, straight through algorithm running on a few million datapoints. GPU's are great. If it deviates even a little from there, gpu's start to fumble. Writing those two algorithms is an afternoons exercise in Mathematica or matlab, but several weeks adventure on a GPU.
And remember computers are cheaper than humans (Currently, $0.12/hr at amazon and $10/hr minimum wage).