graydon / clepsydraLinks
small distributed database protocol
☆31Updated 4 years ago
Alternatives and similar repositories for clepsydra
Users that are interested in clepsydra are comparing it to the libraries listed below
Sorting:
- high-efficiency concurrent reclamation☆38Updated last year
- Yet another key-value storage for Rust☆72Updated 3 years ago
- wait-free 4-level 64-bit pagetable for contiguous low-contention concurrent metadata☆41Updated last year
- trigger io::Error's in test, and annotate their source☆31Updated 2 years ago
- Memory validation framework for Rust☆70Updated 2 months ago
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆85Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- A cross-platform library for fast and safe memory-mapped IO in Rust☆72Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆72Updated 9 months ago
- Scalable and lock-free memory reclamation system☆37Updated last week
- A reader-writer lock that provides extremely fast read access without starving writers☆86Updated 2 years ago
- A Rust implementation of the Strobe protocol framework☆27Updated last week
- This is a project to learn how to implement instruction dispatch in Rust.☆25Updated last year
- A growable bit-vector for Rust, optimized for size☆45Updated 9 months ago
- An optimized sparse merkle tree.☆49Updated 4 years ago
- fast hex☆97Updated 4 months ago
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 4 months ago
- Elias-Fano encoding implementation in Rust☆32Updated 6 years ago
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆114Updated 2 weeks ago
- A low-level MVCC file format for storing blobs.☆64Updated last year
- FST (Fast Succinct Trie) implementation in Rust☆26Updated 6 years ago
- Trying to create Sync bump allocator☆40Updated 4 months ago
- Composable, lock-free, allocation-light data structures☆61Updated 7 years ago
- ☆86Updated 9 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆147Updated 2 weeks ago
- A Rust implementation of Plumtree algorithm☆29Updated 9 months ago
- Logical clocks implementation in Rust☆45Updated 6 years ago
- Combinator methods for `std::AsyncIterator` using all the new `async` superpowers☆10Updated last year
- A flexible binary merkle tree implementation in Rust.☆58Updated 2 years ago