Filters

Article

A Parallel Stable Sort Using C++11 for TBB, Cilk Plus, and OpenMP

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.

Authored by Arch D. Robison (Intel) Last updated on 04/26/2016 - 12:38
For more complete information about compiler optimizations, see our Optimization Notice.