Скачать или смотреть A Naive SPSC Queue in C++ (It Looks Right… Until It Runs)

   • From Naive to Lock-Free Queues  

In the previous videos, we built intuition for how SPSC (Single Producer, Single Consumer) queues work using animations and step-by-step mechanics.

In this video, we take that logic and implement a naive SPSC queue in C++.

The implementation follows the expected design:
One producer thread
One consumer thread
A fixed-size ring buffer
Clean enqueue and dequeue logic

The code compiles.
It runs.
And yet - the behaviour is inconsistent.


▶️ Next video: we’ll explain exactly what goes wrong - data races, visibility, and the memory model - before fixing the queue step by step.

This series progresses deliberately: intuition → mechanics → code → failure → correctness.

#cpp #spsc #coding #tradingsystems #lowlatency #systemsprogramming #quantitativefinance #financeeducation #financetechnology #queue #systemdesign #latency #programming