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.
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.
The newest versions of the Intel® C++ and Fortran compilers now support OpenMP* environment variable OMP_PROC_BIND on compatible non-Intel processors for Linux* and Windows* platfo
MKL VSL example for grouppooledcovariance (vsldgrouppooledcovariance.f) failed with PGI threading layer.
Grouppooledcovariance example crashs with segmentation fault with PGI threading layer on all platforms due to error in PGI support of OpenMP order clause.
This is the second article in a series of articles about High Performance Computing with the Intel Xeon Phi.
By now, many of you have heard of Intel® Transactional Synchronization Extensions (Intel® TSX).
[Updated based on the version of update 2 of 2013 SP1]
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.