komrad36 / SortingNetworksLinks
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.
☆52Updated 4 years ago
Alternatives and similar repositories for SortingNetworks
Users that are interested in SortingNetworks are comparing it to the libraries listed below
Sorting:
- A hash table implementation using Robin Hood Linear Probing☆52Updated 11 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 5 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆61Updated 6 years ago
- Comparing linear and binary searches☆43Updated 5 years ago
- Fast Hash Functions Using AES Intrinsics☆85Updated 6 years ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆140Updated 2 months ago
- Vectorized version of the PCG random number generator☆87Updated last week
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆170Updated 10 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆67Updated 2 months ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆41Updated 11 years ago
- benchmarking positional population count☆17Updated 3 months ago
- ☆39Updated 4 years ago
- ☆112Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆122Updated 5 years ago
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 8 years ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆136Updated 6 years ago
- Fastest Histogram Construction☆74Updated 4 years ago
- For details, see the blog post:☆35Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- A C/C++ header file for fast 32-bit division remainders (and divisibility tests) on 64-bit hardware.☆338Updated last year
- Experiments with array layouts for comparison-based searching☆86Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated 2 years ago
- String map implementation through Fast Succinct Trie☆21Updated 4 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- TLSF: two-level segregated fit O(1) allocator☆82Updated 3 years ago
- A fast alternative to the modulo reduction☆315Updated 4 years ago