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.
This is the second article in a series of articles about High Performance Computing with the Intel Xeon Phi.
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.
Applying Intel® Threading Building Blocks Observers for Thread Affinity on Intel® Xeon Phi™ Coprocessors
In spite of the fact that the Intel® Threading Building Blocks (Intel® TBB) library   provides high-level task based parallelism intended to hide sof
Optimizing Image Resizing Example of Intel® Integrated Performance Primitives with Intel® Threading Building Blocks and Intel® C++ Compiler: Intel® System Studio 2015 for Linux*
For Intel® System Studio 2016, find the corresponding article here