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.
We optimized a version of Dijkstra’s shortest path graph algorithm using a combination of Intel® Cilk™ Plus array notation and OpenMP* parallel for.
Intel® Cilk™ Plus - an extension to the C and C++ languages to support data and task parallelism - is being deprecated in the 2018 release of Intel® Software Development Tools.
Disappointed to see that Cilk Plus is deprecated in compiler 18.0.
Now we need to find suitable alternatives to migrate to.
I hope this is in the correct forum for this.
I saw the article/guide to translate code from cilk plus to TBB or openMP. That's all fine, but the article ignores the concept of Array Notations.