-
sharded-slab
A lock-free concurrent slab
-
crossbeam-deque
Concurrent work-stealing deque
-
crossbeam-epoch
Epoch-based garbage collection
-
crossbeam
Tools for concurrent programming
-
ringbuf
Lock-free SPSC FIFO ring buffer with direct access to inner data
-
loom
Permutation testing for concurrent code
-
boxcar
A concurrent, append-only vector
-
papaya
A fast and ergonomic concurrent hash-table for read-heavy workloads
-
crossfire
channels for async and threads
-
rtrb
A realtime-safe single-producer single-consumer ring buffer
-
thingbuf
I'm at the buffer pool. I'm at the MPSC channel. I'm at the combination MPSC channel and buffer pool.
-
cordyceps
Mycelium intrusive data structures
-
amqprs
AMQP 0-9-1 client implementation for RabbitMQ
-
seize
Fast, efficient, and predictable memory reclamation for concurrent data structures
-
lockfree-object-pool
A thread-safe object pool collection with automatic return and attach/detach semantics
-
crossbeam-queue
Concurrent queues
-
bbqueue
A SPSC, lockless, no_std, thread safe, queue, based on BipBuffers
-
sdd
Scalable lock-free delayed memory reclaimer
-
crossbeam-skiplist
A concurrent skip list
-
orx-concurrent-bag
An efficient, convenient and lightweight grow-only concurrent data structure allowing high performance concurrent collection
-
orx-concurrent-vec
A thread-safe, efficient and lock-free vector allowing concurrent grow, read and update operations
-
object-pool
A thread-safe object pool with automatic return and attach/detach semantics
-
idr-ebr
An efficient concurrent ID to object resolver
-
bus
A lock-free, bounded, single-producer, multi-consumer, broadcast channel
-
amity
Concurrency algorithms
-
pricelevel
high-performance, lock-free price level implementation for limit order books in Rust. This library provides the building blocks for creating efficient trading systems with support for…
-
opool
High-performance, lock-free local and concurrent object pool with automated allocation, cleanup, and verification
-
skl
A lock-free thread-safe concurrent ARENA based (heap backend or memory map backend) skiplist implementation which helps develop MVCC memtable for LSM-Tree
-
concurrent-map
a lock-free linearizable B+ tree
-
left-right
A concurrency primitive for high concurrency reads over a single-writer data structure
-
shm-primitives
Lock-free primitives for shared memory IPC: SPSC ring buffers and Treiber stack slab allocators
-
evmap
A lock-free, eventually consistent, concurrent multi-value map
-
velocityx
A production-ready Rust crate for lock-free concurrent data structures with performance monitoring
-
orx-concurrent-ordered-bag
An efficient, convenient and lightweight grow-only concurrent data structure allowing high performance and ordered concurrent collection
-
lophat
Lockfree Persistent Homology Algorithm Toolbox
-
smallring
High-performance ring buffer with automatic stack/heap optimization | 高性能环形缓冲区,支持栈/堆自动优化
-
pi_arr
lock-free & auto-expansion array
-
atomic-take
Atomically take a value out of a container once
-
arena-b
Production-grade bump allocator with lock-free, slab, and virtual-memory tooling for parsers, game engines, and request-scoped services
-
async-event
An efficient async condition variable for lock-free algorithms
-
nexus-slab
A high-performance slab allocator optimized for predictable tail latency
-
gil
A fast single-producer single-consumer queue with sync and async support
-
atomptr
A safe copy-on-write wrapper around
AtomicPtrwith some extra tricks -
fixed-cache
A minimalistic, lock-free, fixed-size cache
-
bbx_core
Foundational utilities for audio DSP: lock-free SPSC, denormal handling, stack-allocated collections
-
orx-pinned-concurrent-col
A core data structure with a focus to enable high performance, possibly lock-free, concurrent collections using a PinnedVec as the underlying storage
-
nexus-channel
High-performance lock-free SPSC channel for low-latency systems
-
st3
A very fast lock-free, bounded, work-stealing LIFO queue
-
evno
A high-performance event bus for asynchronous tasks and event-driven systems
-
gyre
A lock-free asynchronous ring buffer inspired by the LMAX Disruptor
-
market_square
A lock-free mpmc "square"
-
aarc
An atomically updatable Arc for lock-free concurrency
-
swmr-cell
A thread-safe single-writer multi-reader cell with wait-free reads and version-based garbage collection
-
inqjet
Ultra-fast, low-latency logging for Rust applications
-
rusted-ring
LMAX inspired Lock-free ring buffers with cache-aligned memory pools for high-performance event systems
-
orx-concurrent-option
ConcurrentOption is a lock-free concurrent read and write option type
-
pi_append_vec
Only supports append vectors, lock free
-
rts-alloc
Shared memory allocator intended for small frequent allocations
-
renege
Tracking cache validity using fast concurrent invalidation propogation
-
cache-padded
Prevent false sharing by padding and aligning to the length of a cache line
-
ranged-mmap
Type-safe memory-mapped file library with lock-free concurrent writes to non-overlapping ranges
-
fluxmap
thread-safe, transactional, and concurrent in-memory key-value store for Rust. Offers ACID guarantees with Serializable Snapshot Isolation (SSI) and optional durability via a Write-Ahead Log (WAL)…
-
avila-parallel
Zero-dependency parallel library with work stealing, SIMD, lock-free operations, adaptive execution, and memory-efficient algorithms
-
direct_ring_buffer
A high-performance, lock-free ring buffer for single-producer, single-consumer scenarios
-
avx-parallel
Zero-dependency parallel library with work stealing, SIMD, lock-free operations, adaptive execution, and memory-efficient algorithms
-
nexus-queue
High-performance lock-free SPSC ring buffer for low-latency systems
-
cache-advisor
scan-resistant concurrent cache eviction manager
-
kovan
High-performance wait-free memory reclamation for lock-free data structures. Bounded memory usage, predictable latency.
-
pi_slot
lock free Slotmap data structure
-
lock_freedom
concurrent data structures and a solution to the ABA problem as an alternative of hazard pointers
-
orx-concurrent-queue
A high performance and convenient thread safe queue that can concurrently grow and shrink with push, extend, pop and pull capabilities
-
pi_key_alloter
lock free Key(idx:u32, version:u32) alloter
-
rc_event_queue
VecDeque-like fast, unbounded, FIFO, concurent read-lock-free message queue
-
oneringbuf
A lock-free single-producer, single-consumer (SPSC) ring buffer with in-place mutability, asynchronous support, and virtual memory optimisation
-
fast-stm
Performance-focused implementation of software transactional memory. Allows composable atomic operations
-
atomic_list
Lock-free circular ring of intrusive ref-counted nodes plus shared cursors
-
local_lru
thread-safe and lock-free LRU cache based on thread local storage
-
magnetic
Low-latency lock-free queues
-
codas-flow
Low-latency, high-throughput bounded queues ("data flows") for (a)synchronous and event-driven systems
-
sbitmap
Fast and scalable bitmap implementation based on Linux kernel's sbitmap
-
nexus-slot
High-performance SPSC conflation slot for latest-value-wins scenarios
-
prism3-atomic
User-friendly atomic operations wrapper providing JDK-like atomic API
-
prism3-rust-atomic
User-friendly atomic operations wrapper providing JDK-like atomic API
-
zero-pool
High-performance thread pool with consistent low-latency task dispatch
-
per-thread-object
Efficient per-object thread-local storage implementation
-
lfrlock
A Lock-Free Read Lock where reads never block and writes are serialized using Mutex
-
lowlet
Low-latency IPC library using shared memory and lock-free structures
-
light-qsbr
A lightweight Quiescent-State-Based Reclamation (QSBR) library for safe memory reclamation in lock-free and async runtimes
-
seqmap
A blazing fast seqlock-based concurrent hashmap where every data cell is its own seqlock, suitable for thousands of concurrent readers and writers
-
pi_buckets
lock-free & auto-expansion buckets
-
simple-left-right
Lockfree, realtime safe and copy-free Synchronisation
-
str_cache
A fast, lock-free, thread-safe string interning library
-
ferroc
A fast & lock-free memory allocator library
-
concurrent-pool
A concurrent object pool
-
rt-history
An RT-safe history log with error checking
-
real-time
Safely share data with a real-time thread
-
supersonic
A one-stop rust crate for high-speed, high-performance, high-concurrency data-structures
-
swap-buffer-queue
A buffering MPSC queue
-
atomic-cuckoo-filter
Highly concurrent Cuckoo Filter
-
sarlacc
Thread-safe lock-free interning of data
-
hotswap-config
Zero-downtime configuration management with lock-free hot-reloads and atomic updates
-
lockfree
concurrent data structures and a solution to the ABA problem as an alternative of hazard pointers
-
concurrent-slotmap
A lock-free concurrent slotmap
-
transactional
optimistic lock-free confirmation-based transactional model for Rust
-
loopq
An efficient SPSC lock-free ring buffer with support for no_std, Embassy, and Tokio
-
waitfree-sync
A collection of wait-free data structures
-
lock-free-static
Lock-free static variables
-
listfree
lockfree prepend-only list
-
jacques
High-performance lock-free MPMC queues with horizontal scaling and zero-allocation operation
-
turbo-mpmc
A blazingly fast lock-free MPMC queue that beats crossbeam-channel on SPSC workloads
-
rsmg-core
Core atomic pointer management and concurrent data structures for the RSMG framework
-
vtcode-file-search
Fast, parallel fuzzy file search library for VT Code
-
yep-coc
circular buffer. This one happens to be a zero copy, MPMC, lock free queue.
-
fast-smr
Toward fast, wait-free, portable, and robust memory reclamation
-
snaplock
RwLock with lock-free Reads and sequential Writes
-
bus_queue
Lock-free Bounded non-Blocking Pub-Sub Queue
-
spragga
A scalable concurrent priority queue with relaxed ordering semantics
-
someday
Lock-free MVCC primitive
-
kovan-queue
High-performance queue primitives and disruptor implementation for Kovan
-
chute
Lockfree mpmc/spmc broadcast queue
-
lambda-channel
A crossbeam-like channel concurrently executes lambda functions
-
ring-channel
Bounded MPMC channel abstraction on top of a ring buffer
-
lock-free
High-performance lock-free data structures for Rust with zero dependencies
-
lock_free_hashtable
Lock-free (almost) insertion only hashtable
-
llt-rs
Low-Latency Primitives Toolkit for Rust
-
handler_table
A lock-free table of event handlers
-
disk-ringbuffer
lock free on disk ringbuffer to be used in the implementation of Franz
-
pithanos
Fast, lock-free probabilistic data structures for modern Rust
-
virtual-buffer
A cross-platform library for dealing with buffers backed by raw virtual memory
-
ncp-engine
High performance fuzzy matcher engine
-
rarena-allocator
Lock-free ARENA allocator which can be used in both memory and on-disk
-
quick-bool
A lock-free boolean implementation using atomic operations
-
reft-light
A concurrency primitive for high concurrency reads over a single-writer data structure
-
syncpool
A thread-friendly library for recycle of heavy and heap-based objects to reduce allocation and memory pressure
-
atomic_once_cell
Thread-safe and lock-free OnceCell and Lazy
-
atomicring
AtomicRingBuffer is a constant-size almost lock-free concurrent ring buffer
-
pinboard
A lock-free, threadsafe way to publish data, just stick it on the pinboard
-
lfchring
Concurrent, lock-free implementation of a consistent hashing ring data structure, supporting virtual nodes and keeping track of replication
-
historian
a high performance zero-config histogram implementation
-
anycow
A supercharged container for read-heavy, occasionally-updated data structures with multiple storage strategies
-
freezebox
deref'able lazy-initialized container
-
work-queue
A concurrent work-stealing queue for building schedulers
-
skipfree
lockfree skiplist
-
rtrb-basedrop
A fork of the
rtrbcrate that uses basedrop’s Shared pointer in place of Arc -
quid
fast, concurrent, lock-free UID generation library
-
kovan-map
Lock-free concurrent hash maps using kovan memory reclamation
-
hypercounter
An atomic, lock-free, hash map-like counter structure
-
simple-channels
educational implementation of channels in Rust
-
ringbuf-basedrop
A fork of the
ringbufcrate that uses basedrop’s Shared pointer in place of Arc -
peace-lock
A zero-cost abstraction lock that helps check contention free algorithms
-
kovan-channel
Multi-producer multi-consumer channels using Kovan for memory reclamation
-
rt-write-lock
concurrent, realtime write data structure
-
snowdon
A lightweight thread-safe snowflake ID implementation for Rust
-
nolock
A collection of Lock-Free Datastructures
-
mini-io-queue
Fixed-length, allocation and lock-free, async I/O oriented single-producer single-consumer queues
-
uf_rush
A lock-free, thread-safe implementation of the Union-Find (Disjoint-Set) data structure
-
lock_free_buddy_allocator
Scalable lock-free buddy system allocator
-
atomic_token_bucket
Lock-free Token Bucket algorithm implemented using atomics
-
eventador
lock-free pub/sub event-bus with sync and async APIs
-
atomic-id
Very fast and unique id generation
-
moka-cht
Lock-free resizeable concurrent hash table
-
voluntary-servitude
Thread-safe appendable list with lock-free iterator
-
kismet-cache
A bounded multiprocess cache of files on disk
-
atum
Lock-free bidirectional Atom Table, optimized for multi-threaded workloads
-
async_tasks_recorder
A struct for recording execution status of async tasks with async methods
-
stm
Software transactional memory. Allows composable atomic operations.
-
cht
Lockfree resizeable concurrent hash table
-
atomic-interval
A tiny implementation of an atomic timer
-
circ
Efficient referenced counted pointers for non-blocking concurrency
-
pagecache
lock-free pagecache and log for high-performance databases
-
deque
A (mostly) lock-free concurrent work-stealing deque
-
goko
A lock-free, eventually consistent, concurrent covertree
-
bytering
A ring buffer specialized for vectored reading and writing in blocking and async I/O
-
disruptor-rs
A high-performance ring buffer implementation of the LMAX Disruptor pattern
-
folklore
A lock-free concurrent hash map
-
mvstore
Multi-version page store for mvsqlite
-
blewm
Bloom Filter that Bloo(m) my Mind
-
lincheck
A linearizability checker for concurrent data structures
-
atomic_ptr_cell
Safe no_std repr(transparent) wrapper for AtomicPtr and &AtomicPtr with an api similar to a cell
-
rsdb
a flash-sympathetic persistent lock-free B+ tree, pagecache, and log
-
unstacked
Lock-free, no-std concurrent stack for Rust
-
take_lock
a dead simple lock around Option<Box<T>> thats similar in spirit to OnceLock but adds a bit more flexibility by paying a bit in performance
-
queuecheck
A thread-safe queue testing and benchmarking library
-
wmark
structs to implement optimistic SSI (Serializable Snapshot Isolation) level transactions for database
-
contrie
Concurrent map and set
-
index
a flash-sympathetic persistent lock-free B+ tree
-
grandma
A lock-free, eventually consistent, concurrent covertree
-
rust-rsm
RSM:A Realtime Software Middleware framework. Asynchronous, event driven framework
-
left-right-cell
A cell with lock-free concurrent read access
-
slaballoc
Safe and lockless fixed-size memory allocator for
no_stdsystems -
hazptr
hazard pointer based concurrent memory reclamation
-
atomiq
Convenient tool for atomics in Rust
-
crossbeam-skiplist-fd
A long-term maintained forked version of the crossbeam-skiplist for supporting more flexible key comparison customization
-
rcu_128
RCU (Read-Copy-Update) implementation for platforms supporting atomic 128-bit operations
-
turbovault-core
Core data models and types for TurboVault Server
-
objectpool
lock-free object pool, support no_std
-
oncemutex
A mutex providing one-time synchronized access, then safe unsynchronized access
-
atomic-try-update
Primitives that make it easy to implement correct lock-free algorithms
-
pi_raw_slab
lock-free & auto-expansion raw slab
-
deadpool-amqprs
Dead simple async pool for amqprs
-
crossbeam-skiplist_piedb
A concurrent skip list
-
hyaline-smr
Garbage Collector(Hyaline- Safe Memory Reclaimation) for lock free data structures
-
atomic_cell
Lock-free thread-safe mutable memory locations
-
atomic-slot
lock-free, atomic slot for transferring ownership of Box<T>
-
lifetime-thread
A thread with a lifetime. Divide a value into master and slave. After the lifetime of the master value ends, the slave value will not be accessible.
-
try-rwlock
Fast non-blocking readers-writer lock
-
rarena
Lock-free allocator and data structures based on ARENA
-
lightning-containers
A set of lock-free data structures
-
mvfs
-
concache
A fast, concurrent, shared hash map
-
exclusion-set
a lock-free concurrent set
-
sento
A lock-free, append-only atomic pool
-
lockfree-cuckoohash
lockfree cuckoo hashmap
-
leaklist
concurrent, lock-free, singly-linked list
-
atomic_lifo
Lock free thread-safe lifo for rust
-
bombs
Efficient single-producer multi-consumer channel types
-
swap_channel
A safe lock-free parallel communication channel based on mem::swap
-
lock-free-multi-producer-single-consumer-ring-buffer
A lock-free, multi-producer, single-consumer (MPSC) ring buffer. Optimized for sending and receiving 'bursts' of messages. Can also be used as a ring queue. It is a Rust port of Mindaugas Rasiukevicius's ringbuf.
-
rs_lockfree
a lock-Free lib based on practical Hazard Pointers algorithm
-
rpool
Lock-free generic resource pool implementation
-
nbus
A lock-free, bounded, single-producer, multi-consumer, broadcast channel
-
evlru
An eventually consistent LRU designed for lock-free concurrent reads
-
zedis
A little brokerless persisted lockfree datastore. 7 commands, super simple
-
insert-take
A Concurrent bag supporting atomically inserting and taking all elements
-
ev_slotmap
A lock-free, eventually consistent, concurrent slot map
Try searching with DuckDuckGo.