google / hashtable-benchmarksLinks
☆109Updated last year
Alternatives and similar repositories for hashtable-benchmarks
Users that are interested in hashtable-benchmarks are comparing it to the libraries listed below
Sorting:
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Fast Approximate Membership Filters (C++)☆281Updated last week
- A fast SIMD parser for CSV files☆156Updated 3 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆62Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 6 years ago
- Effective Memory Reclamation☆59Updated 5 years ago
- Fast differential coding functions (using SIMD instructions)☆54Updated 7 years ago
- A fast alternative to the modulo reduction☆311Updated 4 years ago
- Simple C++ code to benchmark fast division algorithms☆52Updated 4 years ago
- ☆128Updated 2 years ago
- Succinct data structures in C/C++☆88Updated 11 months ago
- Very low-overhead timer/counter interfaces for C on Intel 64 processors.☆134Updated 5 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Heap Layers: An Extensible Memory Allocation Infrastructure☆400Updated this week
- Quick sort code using AVX2 instructions☆69Updated 8 years ago
- A persistent hash array-mapped trie for C++☆91Updated 2 years ago
- Portable C++ SIMD library☆173Updated 6 years ago
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆87Updated 3 years ago
- C++ framework for rapid server development☆76Updated last year
- A Wait-Free Universal Construct for Large Objects☆96Updated 5 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆112Updated 8 months ago
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.☆33Updated 9 years ago
- C++ implementation of a fast and memory efficient hash map and hash set specialized for strings☆180Updated 11 months ago
- Fast generalized heap tree algorithms in C++ and C. Provides simultaneous support for D-heap and B-heap.☆135Updated 6 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆36Updated last year
- A collection of formatting benchmarks☆49Updated last month
- Concurrent Deferred Reference Counting☆167Updated last year
- Fast random number generators: Vectorized (SIMD) version of xorshift128+☆118Updated 5 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago