// TODO: I’m martinuke0

Welcome to my corner of the internet. This website is a personal blog which I use as a platform to document my learning journey and showcase it for the world to see.

Illustration of a circular buffer with atomic pointers.

The Mechanics of Thread Safety in Lockless Circular Buffers

A deep dive into lockless circular buffer design, showing how atomic primitives, memory fences, and careful indexing keep multiple producers and consumers safe without locks.

Illustration of a binary heap with atomic arrows indicating lock‑free operations.

Implementing Lock-Free Priority Queues Using Compare and Swap

A deep dive into lock‑free priority queues, explaining the compare‑and‑swap technique, data‑structure choices, correctness proofs, and real‑world benchmarks.

Illustration of a concurrent queue with colored hazard pointers.

How Lock‑Free Queues Handle Memory Reclamation via Hazard Pointers

A deep dive into hazard pointers for lock‑free queues, showing why they matter, how they work, and when to use them over alternative reclamation schemes.

Illustration of a TLA+ state machine for a resilient system.

Building Resilient Systems with Formal Methods and TLA+

A practical guide to using TLA+ for designing fault‑tolerant systems, covering theory, tooling, and real‑world examples.

Illustration of Go runtime with garbage collector threads.

Efficient Garbage Collection for Concurrent Go Programs

A deep dive into Go’s garbage collector, focusing on concurrency, performance tuning, and practical patterns for production services.

Feedback