komora-io / ebrLinks
high-efficiency concurrent reclamation
☆36Updated last year
Alternatives and similar repositories for ebr
Users that are interested in ebr are comparing it to the libraries listed below
Sorting:
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated last month
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆40Updated last year
- trigger io::Error's in test, and annotate their source☆30Updated 2 years ago
- scraps of a potential language☆38Updated 4 years ago
- ☆11Updated 3 weeks ago
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆71Updated 6 months ago
- An experimental columnar arena☆43Updated 10 months ago
- ☆47Updated 4 years ago
- Set theory applied on sorted and deduplicated slices.☆47Updated 2 years ago
- constant-size associative container backed by a simple array☆19Updated 2 years ago
- A growable bit-vector for Rust, optimized for size☆42Updated 6 months ago
- Rust CASPaxos implementation☆66Updated 4 years ago
- Composable, lock-free, allocation-light data structures☆60Updated 7 years ago
- small distributed database protocol☆31Updated 4 years ago
- Rust crate to use process file descriptors (pidfd) for Linux☆50Updated 3 months ago
- Versionize is a framework for version tolerant serializion/deserialization of Rust data structures, designed for usecases that need fast …☆59Updated last year
- The simd optimized escape code☆54Updated last week
- ☆36Updated last year
- ☆39Updated 5 years ago
- A cross-platform library for fast and safe memory-mapped IO in Rust☆71Updated last year
- Concurrent hash trie☆57Updated 4 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- A safe and reliable process manager☆43Updated 5 years ago
- Trying to create Sync bump allocator☆39Updated 2 months ago
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated last month
- A reader-writer lock that provides extremely fast read access without starving writers☆82Updated last year
- [DEPRECATED] Prevent false sharing by padding and aligning to the length of a cache line☆51Updated 2 years ago
- ☆20Updated 2 years ago
- An eventually consistent LRU designed for lock-free concurrent reads☆23Updated 2 years ago