Non-Blocking Lock-Free Queue
An atomic lock-free MPMC queue based on the NBLFQ algorithm.
This repository provides multiple queue implementations with different storage and allocation strategies.
All queues in this repository are safe to use in a concurrent context and will never block the calling thread.
- Static queues: fixed-capacity queues backed by static storage.
- Allocated queues: fixed-capacity queues backed by dynamically allocated storage, only available on feature
alloc. - Dynamic queues: dynamically resizeable queues, only available on feature
dynamic. - Pooled Queues: variants of other queues, which may store arbitrary types, only available on feature
pool.
Non-pooled queues store items in atomically updated slots, restricting the stored items to small, pointer-like values.
nblf_queue::StaticQueue:
#[cfg(feature = "unsafe-ptr48")]
fn run() {
use nblf_queue::{StaticQueue, MPMCQueue};
let q: StaticQueue<_, 2> = StaticQueue::new();
assert!(q.push(&42).is_ok());
assert!(q.push(&1).is_ok());
assert!(q.push(&4242).is_err());
assert_eq!(q.pop(), Some(&42));
assert_eq!(q.pop(), Some(&1));
assert!(q.pop().is_none());
}
#[cfg(feature = "unsafe-ptr48")]
run();nblf_queue::PooledStaticQueue:
#[cfg(feature = "pool")]
fn run() {
use nblf_queue::{PooledStaticQueue, MPMCQueue};
let q: PooledStaticQueue<_, 2> = PooledStaticQueue::new();
assert!(q.push(42).is_ok());
assert!(q.push(1).is_ok());
assert!(q.push(4242).is_err());
assert_eq!(q.pop(), Some(42));
assert_eq!(q.pop(), Some(1));
assert!(q.pop().is_none());
}
#[cfg(feature = "pool")]
run();nblf_queue::DynamicQueue:
#[cfg(feature = "dynamic")]
fn run() {
use nblf_queue::{DynamicQueue, MPMCQueue, Resize};
let q = DynamicQueue::new(1);
assert!(q.push(42).is_ok());
assert!(q.push(4242).is_err());
assert!(q.resize(2));
assert_eq!(q.capacity(), 2);
assert!(q.push(4242).is_ok());
assert_eq!(q.pop(), Some(42));
assert_eq!(q.pop(), Some(4242));
assert!(q.pop().is_none());
}
#[cfg(feature = "dynamic")]
run();Do you have an allocator? -> Use a non-static Queue.
Do you want to send large owned items? -> Use Pooled*.
Do you want to resize your queue? -> Use Dynamic*.
-
StaticQueueandQueue: may only store small values and are optimized for this use case. -
PooledStaticQueueandPooledQueue: may store arbitrary types, at the cost of higher memory usage and runtime cost. -
DynamicQueueandPooledDynamicQueue: may be resized dynamically, at the cost of higher total memory usage and runtime cost. This cost is even higher forPooledDynamicQueue.
Multiple storage types are available, dependent on platform:
-
Tagged64 - platforms with native 64-bit atomic operations or feature
atomic-fallback. -
Tagged128 - platforms with native 128-bit atomic operations or feature
atomic-fallback.
Storage types will be chosen automatically, unless sepcified explicitly.
Note
ABA Safety & Storage Selection
If it is plausible that other threads could perform (2^15 - 1) * queue_size
pop and push operations while a single thread is paused/preempted in pop/push, Tagged128 slots should be used to ensure ABA safety.
Tagged64 Safety
Sending ptr-types via Tagged64 slots is not safe if more than 48 bits are used for pointers.
This is currently enforced with a runtime check, however some unsafe usages may be missed by this check.
-
std: Enablesstdandallocsupport. -
alloc: Enablesallocsupport, allowing usage of some dynamically allocated queues. -
pool: Enables pooled queues, which may store any type. -
dynamic: Enables dynamic queues, which may be dynamically resized. Depends onalloc. -
atomic-fallback: Usesportable-atomicfallbackfeature for atomics if necessary. It is discouraged to use this feature, asfallbackinternally uses locks. -
unsafe-ptr48: implements AsPackedValue for pointers onx86-64andaarch64. This feature is safe to use if 48 or less bits are used for pointers on the target platform. -
default:pool
Python bindings backed by PooledQueue and PooledDynamicQueue are available for concurrent applications.
Core operations detach from the GIL to allow parallel execution.
Note
The Python bindings strictly use Auto slots without feature atomic-fallback.
As a result, these bindings are only supported on platforms with native 64-bit or 128-bit atomic operations.
from nblf_queue import Queue, DynamicQueue
q: Queue[int] = Queue(10)
assert q.push(42) is None
item = q.pop()
assert item == 42
dq: DynamicQueue[str] = DynamicQueue(1)
assert dq.push("hello") is None
assert dq.resize(42)
assert dq.push("world") is NoneThe core test-suite of this crate was adapted from crossbeam-queue.
Current testing is based on:
- Miri - to validate pointer arithmetic and catch UB.
- Loom and Shuttle - to test for race conditions and blocking code.
- Echeneis - to test basic obstruction freedom.
- ASan - to check for memory corruption.
Alexandre Denis, Charles Goedefroit. NBLFQ: a lock-free MPMC queue optimized for low contention. IPDPS 2025 - 39th International Parallel & Distributed Processing Symposium, IEEE, Jun 2025, Milan, Italy. hal-04851700v2