Alternatives and similar repositories for wfmpsc

Users that are interested in wfmpsc are comparing it to the libraries listed below

• dist1ll / lexer-exp
  Experiments with high-throughput lexing on aarch64
  ☆18Updated last year
• tower120 / hi_sparse_bitset
  Hierarchical sparse bitset
  ☆45Updated 2 months ago
• salmans / codd
  A minimal in-memory database with relational algebraic expressions as queries
  ☆61Updated 3 years ago
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆36Updated 3 years ago
• wyfo / swap-buffer-queue
  A buffering MPSC queue.
  ☆79Updated last year
• BurntSushi / nakala
  A low level embedded information retrieval system.
  ☆45Updated 4 years ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆71Updated 4 months ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆81Updated last year
• willcrichton / indexical
  Human-friendly indexed collections
  ☆53Updated last month
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆91Updated last year
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆67Updated 7 years ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆115Updated 4 months ago
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 10 months ago
• utaal / spsc-bip-buffer
  A concurrent, spsc ring-buffer with sized reservations
  ☆100Updated 4 years ago
• espoal / uring_examples
  Rust io_uring examples
  ☆82Updated last year
• cstorey / hybrid-clocks
  ☆12Updated 6 months ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆80Updated last year
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆54Updated last month
• Gab-Menezes / simdphrase
  ☆74Updated 4 months ago
• linebender / fearless_simd
  ☆176Updated this week
• mpdn / radix-heap
  Radix heap implementation in Rust
  ☆33Updated last year
• backtrace-labs / slitter
  Slitter is a C- and Rust-callable slab allocator implemented primarily in Rust, with some C for performance or to avoid unstable Rust fea…
  ☆146Updated 3 years ago
• ballard26 / concurrent-hamt
  ☆82Updated 8 years ago
• rust-lang / odht
  An on-disk hash table implementation
  ☆124Updated 3 years ago
• cloudflare / sliceslice-rs
  A fast implementation of single-pattern substring search using SIMD acceleration.
  ☆96Updated 9 months ago
• prataprc / xorfilter
  Rust library implementing xor-filters
  ☆140Updated 2 years ago
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆34Updated 5 months ago
• main-- / rust-eytzinger
  This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…
  ☆24Updated 4 years ago
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆101Updated last year
• jonhoo / bustle
  A benchmarking harness for concurrent key-value collections
  ☆119Updated 2 years ago