Posted by Michael Bien on Sep 10, 2010; 12:49pm
URL: https://forum.jogamp.org/Are-geometric-build-in-functions-of-OpenCL-noticeably-faster-than-a-naive-plain-Java-implementation-tp1451371p1452109.html

sure, its much faster. But only if you have lots of parallelism in your computation e.g doing thousands of operations in parallel.

On 09/10/2010 11:47 AM, gouessej [via jogamp] wrote:

Hi!

In several 3D engines written in Java, lots of operations are performed on vectors and matrices, I think about dot product, cross product, distance, normalization, addition, subtraction, multiplication... Are such operations noticeably faster with OpenCL than with plain Java?

http://tuer.sourceforge.net
http://gouessej.wordpress.com

---

View message @ http://jogamp.762907.n3.nabble.com/Are-geometric-build-in-functions-of-OpenCL-noticeably-faster-than-a-naive-plain-Java-implementation-tp1451371p1451371.html
To start a new topic under jogamp, email [hidden email]
To unsubscribe from jogamp, click here.

-- 
http://michael-bien.com/