You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
{{ message }}
This repository has been archived by the owner on Feb 1, 2020. It is now read-only.
Would it be straightforward to make the sort parallel, such as using OpenMP? I'm mostly asking if there is a gotcha that I'm missing which would prevent it.
The text was updated successfully, but these errors were encountered:
I have done this in my branch, and am interested if it could be pulled in: #14
As you know, a parallel first pass is not possible. An in-place fully parallel MSD radix sort algorithm does exist. It's called PARADIS, and its authors have never provided their implementation to other researchers. It would appear that a reimplementation of this idea would be required to test it.
Sign up for freeto subscribe to this conversation on GitHub.
Already have an account?
Sign in.
Would it be straightforward to make the sort parallel, such as using OpenMP? I'm mostly asking if there is a gotcha that I'm missing which would prevent it.
The text was updated successfully, but these errors were encountered: