CPU-targeted merge sort #486
Merged
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
This adds CPU-targeted stable merge sort (bottom-up version). It does not use local memory, so it should work on OS X without problems.
Algorithms works in to steps:
It has O(n) space complexity.
If input has 512 elements of less insertion sort is performed. Merge sort outperforms std::sort() on my AMD Phenom(tm) II X3 710 when input has more than 65536, but I think it should work better on a CPU with more cores.
In order to test this algorithm I recommend running
export BOOST_COMPUTE_DEFAULT_DEVICE_TYPE=CPU
(or however it's done in you shell) before executingperf_sort
ortest_sort
. This environment variable makes your CPU the default device for Boost.Compute. Otherwise you will probably end up with GPU being the default device and other sort algorithm will be chosen.If this PR is accepted, I'll soon add similar CPU-targeted sort-by-key algorithm.