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
- benchmarking positional population count☆14Updated last year
- immintrin_dbg.h is an include file, a wrapper around immintrin.h. It implements most of AVX, AVX2, AVX-512 vector intrinsics to enable so…☆57Updated 2 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆56Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- Programatically obtain information about the pages backing a given memory region☆74Updated 3 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆65Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- AVX512F and AVX2 versions of quick sort☆105Updated 7 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- For details, see the blog post:☆32Updated last year
- Fast differential coding functions (using SIMD instructions)☆52Updated 7 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 7 years ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Linear vs binary search benchmark☆41Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Vectorized version of the PCG random number generator☆76Updated 2 weeks ago
- A benchmark for sorting algorithms☆59Updated 3 years ago
- A hash table implementation using Robin Hood Linear Probing☆50Updated 10 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- Compile-time TRIE based string matcher (C++11)☆53Updated 5 years ago
- Code for benchmarking of mutexes to accompany a blog post of mine.☆28Updated 5 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆60Updated last year
- ☆31Updated 3 years ago
- Dictionary-based compression for inverted indexes.☆23Updated 6 years ago