dist1ll / wfmpsc
Wait-free, cache-aware MPSC queue in Rust (proof of concept)
☆14Updated 2 years ago
Alternatives and similar repositories for wfmpsc:
Users that are interested in wfmpsc are comparing it to the libraries listed below
- Hierarchical sparse bitset☆44Updated 9 months ago
- Experiments with high-throughput lexing on aarch64☆16Updated last year
- A flexible and convenient high-level mmap for zero-copy file I/O.☆111Updated last month
- A buffering MPSC queue.☆78Updated 8 months ago
- New register allocator designed as a successor to regalloc2☆36Updated 3 weeks ago
- Human-friendly indexed collections☆53Updated 3 weeks ago
- A Rust data structure for efficient lower-bound lookups☆90Updated last year
- Track memory allocations by backtrace or originating thread☆42Updated 4 months ago
- Adaptive Radix Trie implementation for fixed-length keys☆53Updated last year
- A reader-writer lock that provides extremely fast read access without starving writers☆77Updated last year
- Trying to create Sync bump allocator☆32Updated 4 months ago
- Glommio Messaging Framework (GMF) is a high-performance RPC system designed to work with the Glommio framework.☆52Updated last year
- A collection of boosting algorithms written in Rust 🦀☆51Updated last month
- log for concurrent workloads, with support for atomic batches and in-order recovery☆33Updated 2 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆69Updated last month
- Rust implementation of a fast, bounded, Zipf-distributed random number generator☆33Updated last month
- adaptive algorithms for rayon☆39Updated 4 years ago
- Efficient sampling with uniform probability☆31Updated 2 years ago
- Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability☆81Updated 3 years ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- A concurrent work-stealing queue for building schedulers in Rust☆27Updated last year
- Adaptive Radix Tree in Rust☆67Updated 6 years ago
- Simple Embeddable Persistent Generic HashMap/Key-Value Store☆13Updated 3 years ago
- Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF).☆17Updated last month
- Zero-cost type for stack without complicated type or Box☆45Updated 2 weeks ago
- A Rust port of Jane Street's Incremental library.☆23Updated 2 months ago
- An idiomatic and fast QP-trie implementation in pure Rust.☆100Updated 11 months ago
- memflow I/O primitives☆81Updated last year
- structured parallel execution for async Rust☆33Updated 7 months ago
- scan-resistant concurrent lazy LRU☆58Updated last year