komrad36 / SortingNetworks
Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compilers to generate optimal sorting networks.
☆45Updated 4 years ago
Alternatives and similar repositories for SortingNetworks:
Users that are interested in SortingNetworks are comparing it to the libraries listed below
- Random Number Generator based on hardware-accelerated AES instructions☆57Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 4 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- Vectorized version of the PCG random number generator☆77Updated 2 months ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- ☆106Updated last year
- benchmarking positional population count☆14Updated last year
- Comparing linear and binary searches☆40Updated 5 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- Batched random number generation☆17Updated last week
- ☆39Updated 4 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- A benchmark for sorting algorithms☆60Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Reference implementation of Grisu-Exact in C++☆62Updated 4 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆32Updated 8 years ago
- Compile-time TRIE based string matcher (C++11)☆53Updated 6 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆133Updated 5 years ago
- C++ reimplementation of https://github.com/emilk/drop-merge-sort☆21Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆60Updated last year