search

pelotoncycle / bsort

Extremely fast inplace radix sort
Other
42 stars 17 forks source link

parallelization using OpenMP #7

Open ekg opened 6 years ago

ekg commented 6 years ago

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.

ekg commented 5 years ago

I have done this in my branch, and am interested if it could be pulled in: https://github.com/pelotoncycle/bsort/pull/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.