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.
☆50Updated 4 years ago
Alternatives and similar repositories for SortingNetworks
Users that are interested in SortingNetworks are comparing it to the libraries listed below
Sorting:
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Random Number Generator based on hardware-accelerated AES instructions☆60Updated 6 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Comparing linear and binary searches☆41Updated 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
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Fast Hash Functions Using AES Intrinsics☆83Updated 6 years ago
- ☆39Updated 4 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆30Updated last year
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆41Updated 11 years ago
- Base64 coding and decoding with SIMD instructions (SSE/AVX2/AVX512F/AVX512BW/AVX512VBMI/ARM Neon)☆169Updated 7 months ago
- Fastest Histogram Construction☆72Updated 3 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆64Updated 2 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- Vectorized version of the PCG random number generator☆83Updated 7 months ago
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆46Updated 5 years ago
- benchmarking positional population count☆15Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆119Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- Benchmarks for our memory allocator☆69Updated 2 years ago
- A benchmark for sorting algorithms☆61Updated 4 years ago
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- Coroutines/Fibers implementation for x86☆65Updated 9 years ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A Fast, Multicore-Scalable, Low-Fragmentation Memory Allocator☆163Updated 3 months ago
- ☆109Updated last year
- For details, see the blog post:☆34Updated last year
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆67Updated last year
- Lock-free multithreaded memory allocation☆108Updated 8 years ago