LC

Implement SPSC Lock-Free Queue (Single Producer Single Consumer)

medium5/8

Implement Lock-Free Queue (Michael-Scott Queue)Benchmark Lock-Free vs Mutex-Based Queue Under High Contention

Language

Compiler

2.0s Limit 256MB

Implementation

Implement SPSC lock-free queue.

Requirements:

Implement ring buffer-based queue
Enqueue only callable by producer
Dequeue only callable by consumer
No atomic CAS needed (single producer/consumer)
Handle empty/full conditions
Benchmark throughput
Compare with mutex queue
Demonstrate lock-free property

Why This Matters

The LMAX Disruptor, famous for pushing tens of millions of financial transactions per second on a single machine, is fundamentally a highly-tuned SPSC/MPMC ring buffer built on exactly this insight: with only one writer and one reader, you can drop CAS loops entirely and rely on plain atomic loads and stores. Audio callback buffers and lock-free logging pipelines use this same ring-buffer pattern because it's an order of magnitude cheaper than the general multi-producer queue.

Hints

0 / 3 revealed

Validation Suite

main.c

Workspace 1.0