goldsteinn / SIMD-sorting-networkLinks
SIMD sorting network generator and very basic tester
☆16Updated 3 years ago
Alternatives and similar repositories for SIMD-sorting-network
Users that are interested in SIMD-sorting-network are comparing it to the libraries listed below
Sorting:
- ☆31Updated 3 years ago
- Benchmarks for our memory allocator☆68Updated last year
- benchmarking positional population count☆15Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 5 years ago
- ☆39Updated 4 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆68Updated 4 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- A fast implementation of log() and exp()☆53Updated 2 years ago
- Vectorized version of the PCG random number generator☆80Updated 5 months ago
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆117Updated 5 years ago
- A collection of SIMD optimized general purpose hash functions☆47Updated 10 years ago
- For details, see the blog post:☆32Updated last year
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- LZ77/LZSS designed for SSE based decompression☆142Updated 6 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Generic SIMD intrinsic to allow for portable SIMD intrinsic programming☆42Updated 11 years ago
- Reference implementation of Grisu-Exact in C++☆67Updated 4 years ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆135Updated 5 years ago
- DSL for SIMD Sorting on AVX2 & AVX512☆31Updated 6 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆48Updated 4 years ago
- Small Hash Optimization - an optimization for when you have many small hash maps - similar to LLVM's small vector optimization.☆39Updated 8 years ago
- Unstable O(n log n) sorting algorithm with O(n) memory☆61Updated last year
- Polyfill some holes in the SSE intrinsics set☆50Updated 3 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 4 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Slotmap is a sequence container with weak reference keys written in C++17.☆39Updated 10 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 2 years ago
- Fastest Histogram Construction☆70Updated 3 years ago
- header-only C++ template library to process n-dimensional arrays with multithreaded SIMD code☆45Updated 6 months ago