google / zuckerliLinks
☆28Updated 3 years ago
Alternatives and similar repositories for zuckerli
Users that are interested in zuckerli are comparing it to the libraries listed below
Sorting:
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆84Updated 6 years ago
- A small DFA for under 16 states☆53Updated 7 years ago
- Information about AVX-512 support on recent Intel processors☆45Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- 8-bit Xor Filter in C99☆62Updated 5 years ago
- Succinct data structures in C/C++☆91Updated last year
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated last month
- Poireau: a sampling allocation debugger☆98Updated 3 years ago
- Learned Monotone Minimal Perfect Hashing☆31Updated 8 months ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 4 years ago
- ☆16Updated 8 years ago
- ☆111Updated last year
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- SIMDized check which bytes are in a set☆28Updated 7 years ago
- ☆22Updated 3 years ago
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Methods and Benchmarks for Random Numbers in a Range☆37Updated 7 years ago
- A benchmark for sorting algorithms☆62Updated 4 years ago
- Testing memory-level parallelism☆82Updated last year
- Counting the collisions with perl hash tables per function☆12Updated 6 years ago
- Markup source code showing optimizations☆36Updated 5 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆117Updated 2 months ago
- ☆12Updated 2 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 5 years ago