travisdowns / concurrency-hierarchy-bench
Supporting code for the concurrency hierarchy described in this blog post: https://travisdowns.github.io/blog/2020/07/06/concurrency-costs.html.
☆26Updated 2 years ago
Alternatives and similar repositories for concurrency-hierarchy-bench:
Users that are interested in concurrency-hierarchy-bench are comparing it to the libraries listed below
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- The space of memory management research and systems produced by the PLASMA lab (https://plasma-umass.org).☆20Updated 4 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Implementation of the algorithms from "Scalable Lock-Free Dynamic Memory Allocation"☆16Updated 10 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Lock-free multithreaded memory allocation☆105Updated 8 years ago
- Bloom filter alternative (C++)☆17Updated 6 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- LLVM-jitted bitmaps☆26Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago
- Bitset Sort, a faster std::sort replacement.☆78Updated 3 years ago
- Benchmark program for ForestDB, Couchstore, LevelDB, RocksDB, and WiredTiger☆33Updated 4 years ago
- Programatically obtain information about the pages backing a given memory region☆74Updated 3 years ago
- ☆20Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- ☆12Updated last year
- C implementations of several scalable non-blocking data structures for x86 and x86-64.☆38Updated 13 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Cache Oblivious Lookahead Arrays☆27Updated 11 years ago
- Fast linearizability checker☆66Updated 9 years ago
- Simple out-of-process invoker☆18Updated 9 months ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year