This article describes the parallel sorts in the latest release of “Cilkpub”, an open-source library of utilities for Intel®
This blog discusses how to "spawn a statement" in Cilk Plus and some pragmatic considerations for doing so.
Cilk Plus has two ways to create parallelism:
This article explains the sparse ruler problem, two parallel codes for computing sparse rulers, and some new results that reveal a surprising "gap" behavior for solutions to the sparse ruler proble
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.
The N-Body problem is a classic example used frequently to demonstrate parallelization and how it improves performance.