Login  Register

Re: Are geometric build-in functions of OpenCL noticeably faster than a naive plain Java implementation?

Posted by Demoscene Passivist on Sep 10, 2010; 1:05pm
URL: https://forum.jogamp.org/Are-geometric-build-in-functions-of-OpenCL-noticeably-faster-than-a-naive-plain-Java-implementation-tp1451371p1452199.html

Generally speaking: Yes!

OpenCL implements a massive parallel execution model. So as long as u can parallelize ur problem and u have a massive parallel hardware device (like current multicore CPUs or standard consumer GPUs)  u are good to go with OpenCL. This is ofcourse the case for the basic vector/matrice operations u mentioned.

In comparison to native Java the speedup to expect is at least 10x up to a couple of 100x depending on the operations u use.

The downside however is that there is a significant overhead cost involved in "setting-up" ur data to be processed by OpenCL, and collecting the results. So if u got only very little data the setup overhead may be higher that the actual processing time in plain Java. For most 3D engines however this is definitly not the case.