| avx_qsort | tidb | |
|---|---|---|
| 2 | 1 | |
| 67 | 19 | |
| - | - | |
| 10.0 | 0.0 | |
| almost 7 years ago | almost 2 years ago | |
| Assembly | Go | |
| - | Apache License 2.0 |
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
tidb
Posts with mentions or reviews of tidb.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-06-04.
-
Significantly faster quicksort using SIMD
This is great, and can definitely help quite a lot database and big data projects. I can immediately imagine this is a perfect match to one open source HTAP system (https://github.com/tigraph/tidb) which uses SIMD in their columnar processing engine TiFlash (https://github.com/pingcap/tiflash).
What are some alternatives?
When comparing avx_qsort and tidb you can also consider the following projects:
highway - Performance-portable, length-agnostic SIMD with runtime dispatch
perf-challenge6
parallel-string-sorting - Collection of Parallel String Sorting Algorithms including Parallel Super Scalar String Sample Sort and Parallel Multiway LCP-Mergesort
zerovm-samples - Sample code and libraries built for ZeroVM