komora-io / optimistic-cellLinks
☆21Updated 3 years ago
Alternatives and similar repositories for optimistic-cell
Users that are interested in optimistic-cell are comparing it to the libraries listed below
Sorting:
- Very fast lock-free, bounded, work-stealing queues with FIFO stealing and LIFO or FIFO semantic for the worker thread.☆85Updated last year
- A low-level MVCC file format for storing blobs.☆64Updated last year
- The `io_uring` library for Rust (with Rustix)☆35Updated 4 months ago
- Lending iterators on stable Rust☆83Updated last year
- (lifetime) GATs on stable Rust☆59Updated last year
- log for concurrent workloads, with support for atomic batches and in-order recovery☆37Updated 3 years ago
- ☆39Updated last year
- ☆24Updated 2 years ago
- Thread-safe clone-on-write container for fast concurrent writing and reading.☆49Updated 2 years ago
- A proc macro for real async traits, using nightly-only existential types and generic associated types to work around the need for type er…☆45Updated 3 years ago
- Fast Function Dispatch: Improving the performance of Rust's dynamic function calls☆33Updated last year
- A flexible and convenient high-level mmap for zero-copy file I/O.☆116Updated 9 months ago
- structured parallel execution for async Rust☆37Updated last year
- Serde serializer for generating Starlark build targets☆69Updated 2 weeks ago
- Byte-wise atomic memcpy.☆38Updated last month
- Combinator methods for `std::AsyncIterator` using all the new `async` superpowers☆10Updated last year
- A reader-writer lock that provides extremely fast read access without starving writers☆86Updated 2 years ago
- Human-friendly indexed collections☆56Updated last month
- Adaptive Radix Trie implementation for fixed-length keys☆54Updated 4 months ago
- ☆56Updated 2 months ago
- cross-platform Rust API for memory mapped IO☆42Updated last year
- super simple in-memory blocking LSM for constant-size keys and values☆72Updated 9 months ago
- A benchmarking harness for concurrent key-value collections☆118Updated 2 years ago
- Queue futures to run concurrently, in the order they're spawned, and with global and group limits.☆66Updated this week
- ☆44Updated 6 months ago
- A lock-free, append-only atomic pool.☆68Updated 3 years ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆73Updated last year
- Nudging the compiler to auto-vectorize things☆75Updated 2 years ago
- A low-level I/O ownership and borrowing library☆106Updated 3 months ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago