5 posts with tag lock-free

• 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.

• rust
• concurrency
• lock-free
• cache-coherence
• false-sharing
• data-layout
• memory-alignment
• ring-buffer
• systems-programming
• performance

How to lay out a shared Rust struct by who-touches-what - zoning fields by write owner and frequency, then padding the cross-core ones to avoid false sharing and prefetcher-induced contention.

• rust
• concurrency
• lock-free
• spsc
• ring-buffer
• cache-coherence
• false-sharing
• systems-programming
• performance
• scalability
• optimization

The opening post of a Low-Level Systems Design in Rust series, arguing that the biggest performance win is structural: replace a shared multi-producer cursor that serializes cores through cache-coherence traffic with one private single-writer SPSC ring per producer, converting quadratic writer contention into a cheap O(N) consumer sweep.