skarupke / two_bit_mutexLinks
Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
☆26Updated 3 years ago
Alternatives and similar repositories for two_bit_mutex
Users that are interested in two_bit_mutex are comparing it to the libraries listed below
Sorting:
- Benchmarks for our memory allocator☆70Updated 2 years ago
- Looking into the performance of heaps, starting with the Min-Max Heap☆69Updated 4 years ago
- Structure-of-array synthesis in C++20☆80Updated 3 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆36Updated 7 years ago
- Comparing linear and binary searches☆43Updated 5 years ago
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆71Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- ☆39Updated 4 years ago
- TLSF: two-level segregated fit O(1) allocator☆82Updated 3 years ago
- Memory alignment wrappers, useful for avoiding false sharing☆41Updated 9 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆42Updated last year
- A fast implementation of log() and exp()☆56Updated 3 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆76Updated 3 years ago
- EDSL for C++ to make just-in-time code generation easier☆87Updated 2 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Reference implementation of Grisu-Exact in C++☆69Updated 5 years ago
- benchmarking positional population count☆17Updated 2 months ago
- Fast multi-threaded memory allocator☆79Updated 6 years ago
- Lace - implementation of work-stealing in C☆55Updated 5 months ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆49Updated 2 years ago
- ☆31Updated 2 months ago
- ☆112Updated last year
- Fast C header-only library for popcnt, pospopcnt, and set algebraic operations☆45Updated 6 years ago
- Cache-friendly associative STL-like container with an Eytzinger (BFS) layout for C++☆33Updated 8 years ago
- A hash table implementation using Robin Hood Linear Probing☆51Updated 11 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆52Updated 4 years ago
- ☆32Updated 4 years ago
- portability macros for compiler and hardware micro operations☆36Updated last year
- ☆25Updated 5 years ago