skarupke / two_bit_mutexLinks
Mutexes that only use two bits. Either stored in a byte, or in the bottom bits of a pointer
☆25Updated 2 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:
- Looking into the performance of heaps, starting with the Min-Max Heap☆68Updated 4 years ago
- Benchmarks for our memory allocator☆69Updated last year
- EDSL for C++ to make just-in-time code generation easier☆85Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆40Updated 5 years ago
- Structure-of-array synthesis in C++20☆80Updated 3 years ago
- ☆31Updated last week
- Create man pages from information used by Intel Intrinsics Guide and optionally uops.info☆45Updated 9 months ago
- For details, see the blog post:☆33Updated last year
- Optimized for systems that read and write large blobs.☆12Updated 10 years ago
- Fast, shared, upgradeable, non-recursive and non-fair mutex☆34Updated 7 years ago
- A unique_ptr implementation with small object optimization☆19Updated last year
- Comparing linear and binary searches☆41Updated 5 years ago
- Flash Perfect Hash Table: an implementation of a dynamic perfect hash table, extremely fast for lookup☆47Updated 2 years ago
- Library for lock-free locks☆83Updated 2 years ago
- Fastest CPU SIMD (SSE4) sorting networks for small integer arrays (2-6 elements), also optimal amd64 assembly and notes on getting compil…☆50Updated 4 years ago
- ☆26Updated 5 years ago
- Memory alignment wrappers, useful for avoiding false sharing☆41Updated 9 years ago
- A fast implementation of log() and exp()☆52Updated 2 years ago
- TLSF: two-level segregated fit O(1) allocator☆80Updated 3 years ago
- ☆39Updated 4 years ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆74Updated 2 years ago
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆26Updated 3 years ago
- benchmarking positional population count☆15Updated last year
- Collection of high performance C++ containers that can be chosen as drop-in replacements for std::vector and std::set☆37Updated 2 weeks ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆62Updated last year
- A set of benchmarking tools used to quantify the performance of BDE-style polymorphic allocators.☆33Updated 9 years ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆37Updated last year
- ☆109Updated last year
- ☆31Updated 4 years ago
- A C++ library that simplifies working with tuples, variants, and more through argument list generation and the ability to convert from ru…☆62Updated 5 years ago