Alternatives and similar repositories for wfmpsc:

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

• tower120 / hi_sparse_bitset
  Hierarchical sparse bitset
  ☆45Updated 2 weeks ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆112Updated 2 months ago
• wyfo / swap-buffer-queue
  A buffering MPSC queue.
  ☆78Updated 10 months ago
• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆78Updated last year
• asynchronics / tachyonix
  An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds
  ☆120Updated 7 months ago
• dist1ll / lexer-exp
  Experiments with high-throughput lexing on aarch64
  ☆17Updated last year
• conradludgate / what-the-async
  Simple async reactor and executor for rust
  ☆79Updated last month
• bastion-rs / numanji
  Local-affinity first NUMA-aware allocator with optional fallback.
  ☆24Updated 4 years ago
• willcrichton / indexical
  Human-friendly indexed collections
  ☆53Updated 2 months ago
• tower120 / rc_event_queue
  VecDeque-like fast, unbounded, mpmc/spmc concurent FIFO message queue. Lockless reads, write-lock writes.
  ☆21Updated 6 months ago
• matthieu-m / jagged
  Collection of insert-only wait-free data-structures.
  ☆29Updated last year
• flier / rust-t1ha
  Rust implementation for T1HA (Fast Positive Hash)
  ☆88Updated last year
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆90Updated last year
• Dennis-Krasnov / Uringy
  A simple single-threaded concurrency runtime for Rust based on io_uring.
  ☆29Updated last year
• diwic / shmem-ipc
  Untrusted IPC with maximum performance and minimum latency. On Rust, on Linux.
  ☆148Updated 2 years ago
• Patryk27 / ostfs
  Toy filesystem with support for zero-cost snapshots and clones
  ☆39Updated last year
• espoal / uring_examples
  Rust io_uring examples
  ☆81Updated last year
• jeffparsons / rangemap
  Map data structure whose keys are stored as ranges
  ☆88Updated 4 months ago
• SabrinaJewson / work-queue.rs
  A concurrent work-stealing queue for building schedulers in Rust
  ☆27Updated last year
• arthurprs / qfilter
  Efficient bloom filter like datastructure, based on the Rank Select Quotient Filter (RSQF).
  ☆19Updated 2 weeks ago
• sunshowers-code / partial-io
  Rust library that provides helpers for testing resilience of I/O operations.
  ☆32Updated 2 years ago
• Thomasdezeeuw / a10
  Library safely exposing the io_uring API.
  ☆62Updated last month
• koute / schnellru
  A fast and flexible LRU map.
  ☆181Updated 4 months ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated last year
• cstorey / hybrid-clocks
  ☆12Updated 4 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆69Updated 2 months ago
• jonhoo / strawpoll
  ☆17Updated 4 months ago
• bertptrs / beul
  It executes futures
  ☆58Updated 2 years ago
• oxidecomputer / cancel-safe-futures
  Alternative future adapters that provide cancel safety.
  ☆63Updated this week
• ibraheemdev / boxcar
  A concurrent, append-only vector.
  ☆159Updated last week