5 posts with tag spsc-queue

• rust
• unsafe-rust
• backoff
• spin-loop
• allocators
• numa
• huge-pages
• lock-free
• spsc-queue
• ring-buffer
• performance

Two resources a lock-free ring buffer takes for granted: time and memory. Adaptive backoff for waiting well, and a pluggable allocator trait for NUMA placement and huge pages.

• rust
• unsafe-rust
• monomorphization
• const-generics
• zero-sized-types
• inlining
• bounds-check-elimination
• branch-prediction
• lock-free
• spsc-queue
• ring-buffer
• performance

How const generics, zero-sized types, branch and arithmetic hygiene, and disciplined inlining hand the Rust compiler enough compile-time facts to make sizes immediate, unused features free, and redundant checks disappear in a lock-free SPSC ring buffer.

• rust
• unsafe-rust
• zero-copy
• maybe-uninit
• panic-safety
• lock-free
• spsc-queue
• ring-buffer
• branch-prediction
• fast-path
• performance

How a reserve/commit protocol eliminates per-item copies in a lock-free SPSC ring buffer, and how fast-path/slow-path splitting keeps the common case branch-predictable.

• rust
• unsafe-rust
• concurrency
• atomics
• memory-ordering
• release-acquire
• lock-free
• spsc-queue
• ring-buffer
• unsafe-cell
• single-writer
• cursor-caching
• batching
• cache-coherence
• performance

How cursor caching and batch processing amortize the cost of cross-core coordination in a lock-free SPSC ring buffer, so cores touch shared atomics a fraction as often.

• rust
• unsafe-rust
• concurrency
• atomics
• memory-ordering
• release-acquire
• lock-free
• spsc-queue
• ring-buffer
• unsafe-cell
• single-writer
• performance

How Release/Acquire ordering, Relaxed counters, and single-writer UnsafeCell state make lock-free Rust ring buffers correct and efficient.