Archives

Implementing a Go-style defer mechanism in C++

A deep dive into fixed timesteps and floating point determinism.

Completing the lock-free deque with the `steal` operation. We look at how thieves safely race against the owner and how to integrate this into a robust scheduler.

Implementing the lock-free `push` and `pop` for the deque owner, handling cache alignment, and managing the race condition when the queue becomes empty.

Moving beyond locks requires understanding how CPUs reorder instructions. We explore atomics, acquire/release semantics, and the illusion of sequential execution.

Why a central task queue becomes a bottleneck, how false sharing kills performance, and building a baseline implementation with locks.

What if you could write to a buffer and have it loop forever, with no branches, no checks, and no wrap-around logic?

What if your allocator could recycle like a pro, pack for cache, perfect loops, and deliver unbreakable handles, without leaks or dangling pointers?

Stop asking the OS for memory. Learn how to build an Arena: a private memory block where allocation is instant and an entire class of bugs is impossible.

Ever wondered how your computer runs multiple programs without them setting each other on fire? The answer is Virtual Memory.