To avoid memory access conflict, the algorithms are based on a parallel merge algorithm.

Emad Omara's parallel merge sort algorithm assumes that you will have full access to the machine's CPUs for the duration of the sorting operation.

When parallel paths are used, each path must merge or end.