vkrasnov / avx_qsort
Quick sort code using AVX2 instructions
☆68Updated 7 years ago
Alternatives and similar repositories for avx_qsort:
Users that are interested in avx_qsort are comparing it to the libraries listed below
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- 8-bit Xor Filter in C99☆61Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆64Updated last year
- Bloom filter alternative (C++)☆17Updated 6 years ago
- LLVM-jitted bitmaps☆26Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Concurrent trie-hash map library☆91Updated last year
- Methods and Benchmarks for Random Numbers in a Range☆34Updated 6 years ago
- Fast and Reliable (but not Secure) Hash☆53Updated 6 years ago
- ☆25Updated 7 years ago
- ☆27Updated 2 years ago
- Shuffle-based predicate matcher and all-round branch free swiss army chainsaw☆17Updated 6 years ago