Amanieu / seqlockLinks
A reader-writer lock that provides extremely fast read access without starving writers
☆81Updated last year
Alternatives and similar repositories for seqlock
Users that are interested in seqlock 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.☆80Updated 10 months ago
- A benchmarking harness for concurrent key-value collections☆119Updated 2 years ago
- rust bindings of snmalloc☆136Updated 3 months ago
- A Rust implementation of two segment trees and a fenwick tree.☆66Updated 6 years ago
- io traits/structs for tokio that automatically recover from potential disconnections/interruptions☆72Updated last year
- Non-interleaving multithreaded output queue☆71Updated last month
- Cross-platform atomic wait and wake (aka futex) functionality for Rust.☆128Updated last month
- A growable bit-vector for Rust, optimized for size☆42Updated 4 months ago
- A cross-platform library for fast and safe memory-mapped IO in Rust☆71Updated last year
- 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
- A lock-free, append-only atomic pool.☆67Updated 3 years ago
- Local-affinity first NUMA-aware allocator with optional fallback.☆28Updated 4 years ago
- (lifetime) GATs on stable Rust☆59Updated last year
- A Rust data structure for efficient lower-bound lookups☆91Updated last year
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- An experimental asynchronous runtime based on `io-uring`.☆77Updated 4 years ago
- Framework for simulating distributed applications☆102Updated 5 years ago
- A `VecDeque` (and `Vec`) variant that spreads resize load across pushes.☆107Updated 6 months ago
- Map data structure whose keys are stored as ranges☆89Updated 6 months ago
- A fast and flexible LRU map.☆189Updated 6 months ago
- Time and duration crate optimized for speed and API stability.☆72Updated last month
- Enhancement over Rust's `std::BinaryHeap`. Supports other than max heap.☆57Updated last year
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- Library safely exposing the io_uring API.☆64Updated 3 months ago
- Rust interface for Linux futexes, the fast user-space locking primitive.☆87Updated last year
- Lockfree resizeable concurrent hash table.☆54Updated 3 years ago
- An LRU cache implementation with constant time operations and weighted semantic.☆46Updated 6 months ago
- perf-event: a Rust interface to Linux performance monitoring☆120Updated last month
- An on-disk hash table implementation☆123Updated 3 years ago
- Lending iterators on stable Rust☆83Updated last year