Ray-tracing is a classic example of an embarrassingly parallel algorithm; since each pixel is typically independent of the rest, theoretically every pixel can be done in parallel (given enough core
The N-Body problem is a classic example used frequently to demonstrate parallelization and how it improves performance.
Home >> | Back to Courseware Access page >> |
I've got a great wife. For my birthday she got me a copy of the newly updated Introduction to Algorithms, 3rd ed. by Cormen, Leiserson, Rivest, and Stein.
(This work was done by Vivek Lingegowda during his internship at Intel.)
There is a long discussion talking about the advantages of Procedural Programming vs. the advantages of Object Oriented Programming.
Download paper as PDF
This article describes a parallel merge sort code, and why it is more scalable than parallel quicksort or parallel samplesort. The code relies on the C++11 “move” semantics.
Product Version: Intel(R) Visual Fortran Compiler XE 15.0 or a later version