pramalhe / CX
A Wait-Free Universal Construct for Large Objects
☆96Updated 5 years ago
Alternatives and similar repositories for CX:
Users that are interested in CX are comparing it to the libraries listed below
- The world's first wait-free Software Transactional Memory☆173Updated 5 years ago
- Poireau: a sampling allocation debugger☆87Updated 3 years ago
- Testing memory-level parallelism☆67Updated last year
- Fast Hash Functions Using AES Intrinsics☆82Updated 5 years ago
- ☆39Updated 4 years ago
- ☆105Updated last year
- An Evaluation of Linear Probing Hashtable Algorithms☆29Updated last year
- Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…☆144Updated 3 years ago
- This is the public release of the ffwd delegation system, and associated benchmarks from the SOSP'17 paper.☆78Updated 7 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Dynamic runtime inlining with LLVM☆66Updated 3 years ago
- A dynamically safe implementation of C, using your existing C compiler. Tolerates idiomatic C code pretty well. Not perfect... yet.☆104Updated 7 months ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆155Updated 2 months ago
- A C library for runtime-flippable feature flags on Linux/x86-64, with negligible overhead in the common case☆73Updated 2 years ago
- Testing framework for the quest to find a fast & strong mixer, e. g for hashtables.☆38Updated 4 years ago
- Demonstration of LLVM's opt-viewer tool☆71Updated 8 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- A description of Minotaur can be found in https://arxiv.org/abs/2306.00229.☆104Updated 8 months ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- c++ library for binary fuse filters, including a sharded filter☆87Updated 2 months ago
- A small DFA for under 16 states☆51Updated 6 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆36Updated 6 years ago
- Quick sort code using AVX2 instructions☆68Updated 7 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- Hyaline Reclamation (PLDI '21, PODC '19)☆20Updated 3 years ago
- qp tries and crit-bit tries☆119Updated 2 years ago
- ☆29Updated this week
- ☆48Updated 4 years ago