dist1ll / wfmpsc

Related projects: ⓘ

• Amanieu / seqlock
  A reader-writer lock that provides extremely fast read access without starving writers
  ☆70Updated 11 months ago
• dist1ll / lexer-exp
  Experiments with high-throughput lexing on aarch64
  ☆13Updated 5 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆89Updated 6 months ago
• wyfo / swap-buffer-queue
  A buffering MPSC queue.
  ☆75Updated 2 months ago
• tower120 / hi_sparse_bitset
  Hierarchical sparse bitset
  ☆41Updated 2 months ago
• jeffparsons / rangemap
  Map data structure whose keys are stored as ranges
  ☆74Updated 6 months ago
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆95Updated 5 months ago
• Thomasdezeeuw / a10
  Library safely exposing the io_uring API.
  ☆50Updated last month
• espoal / uring_examples
  Rust io_uring examples
  ☆73Updated 5 months ago
• Patryk27 / ostfs
  Toy filesystem with support for zero-cost snapshots and clones
  ☆36Updated 6 months ago
• jkarneges / rust-async-bench
  The cost of Rust async/await
  ☆73Updated 2 years ago
• al8n / fmmap
  A flexible and convenient high-level mmap for zero-copy file I/O.
  ☆105Updated 7 months ago
• nwtgck / stacklover-rust
  Zero-cost type for stack without complicated type or Box
  ☆45Updated 2 weeks ago
• oxidecomputer / cancel-safe-futures
  Alternative future adapters that provide cancel safety.
  ☆55Updated last week
• rust-lang / odht
  An on-disk hash table implementation
  ☆104Updated 2 years ago
• asynchronics / tachyonix
  An asynchronous, multi-producer, single-consumer (MPSC) bounded channel that operates at tachyonic speeds
  ☆111Updated last week
• jeehoonkang / membarrier-rs
  Rust library for memory barrier
  ☆32Updated 4 months ago
• planus-org / planus
  ☆93Updated 2 weeks ago
• CJP10 / object-pool
  Thread-safe object pool with automatic return and attach/detach semantics
  ☆73Updated 3 weeks ago
• Diggsey / ijson
  More efficient alternative to `serde_json::Value` which saves memory by interning primitive values and using tagged pointers.
  ☆125Updated 6 months ago
• teryror / coca
  Allocation-free data structures that make do with the memory they're given
  ☆144Updated 2 years ago
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆55Updated last year
• kprotty / yaar
  Yet Another Async Runtime (yaar) focused on forbid(unsafe) and scalability
  ☆80Updated 2 years ago
• Gregory-Meyer / cht
  Lockfree resizeable concurrent hash table.
  ☆51Updated 2 years ago
• Protryon / alloc-track
  Track memory allocations by backtrace or originating thread
  ☆40Updated 11 months ago
• vorner / slipstream
  Nudging the compiler to auto-vectorize things
  ☆71Updated last year
• main-- / rust-lz-fear
  A fast pure-rust no-unsafe implementation of LZ4 compression and decompression
  ☆108Updated 7 months ago
• diwic / shmem-ipc
  Untrusted IPC with maximum performance and minimum latency. On Rust, on Linux.
  ☆130Updated last year
• fitzgen / fast-bernoulli
  Efficient sampling with uniform probability
  ☆32Updated 2 years ago
• jonhoo / sento
  A lock-free, append-only atomic pool.
  ☆66Updated 2 years ago