avx_qsort
Quick sort code using AVX2 instructions (by vkrasnov)
zerovm-samples
Sample code and libraries built for ZeroVM (by zerovm)
avx_qsort | zerovm-samples | |
---|---|---|
2 | 1 | |
67 | 7 | |
- | - | |
10.0 | 10.0 | |
almost 7 years ago | about 9 years ago | |
Assembly | C | |
- | - |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
avx_qsort
Posts with mentions or reviews of avx_qsort.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-17.
-
Sorting with SIMD
The original (AFAICT) work on SIMD quick sort, also mentioned in the google post also implemented pointer sort by loading a pointed key using gather instructions and the method can be used for an array of structs. https://github.com/vkrasnov/avx_qsort/blob/master/qsort_AVX2...
-
Significantly faster quicksort using SIMD
I'm the co-author of one of the papers referenced in the blogpost, (Fast Quicksort Implementation Using AVX Instructions), we did write the AVX512 code back in 2015, just had nowhere to run it, at least publicly. The paper also very explicitly says that the lookup tables can be instead replaced by the AVX512 compress instructions. The code for that paper is available in https://github.com/vkrasnov/avx_qsort
zerovm-samples
Posts with mentions or reviews of zerovm-samples.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-12-17.
-
Sorting with SIMD
I wonder why no one mentions bitonic sort? If you want to do anything in SIMD you better avoid branching as much as possible... and ideally altogether. Here is an implementation I co-authored some 10 years ago: https://github.com/zerovm/zerovm-samples/blob/master/disort/...
Sorting-networks which were already mentioned seems similar but a bit too abstract.
My code above doesn't contains values but those are easy to add I think. Of course it is better to permute fixed size pointers / offsets and not the entire blobs which can be of variable size and then it will complicate everything beyond feasible for SIMD
What are some alternatives?
When comparing avx_qsort and zerovm-samples you can also consider the following projects:
highway - Performance-portable, length-agnostic SIMD with runtime dispatch
perf-challenge6
zort - Sorting algorithms in zig
parallel-string-sorting - Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
short-simd-sorter