Illustration of a B‑link tree node with side pointers bypassing locks.

Reducing Lock Contention with Side Pointers in B‑link Trees

Side pointers provide a low‑overhead way to break hot‑spot locks in B‑link trees, improving scalability without sacrificing correctness.

May 18, 2026 · 9 min · 1849 words · martinuke0
Diagram of quorum reads and writes across nodes.

The Statistical Reality of Quorum Reads and Writes

A deep dive into the math behind quorum operations, showing how to predict consistency, latency, and failure risk in modern distributed stores.

May 18, 2026 · 2 min · 250 words · martinuke0
Illustration of multiple CPU cores with shared cache lines.

How the MESI Protocol Resolves Stale Cache States

A deep dive into the MESI protocol, showing how it prevents stale cache states through precise state transitions and real‑world examples.

May 18, 2026 · 8 min · 1606 words · martinuke0
Illustration of isolated Erlang processes communicating via message passing.

How Erlang Process Isolation Governs the Actor Model

Erlang’s process isolation is the core of its Actor Model implementation, delivering robust fault‑tolerance and massive scalability.

May 18, 2026 · 6 min · 1228 words · martinuke0
Illustration of two database rows diverging under snapshot isolation.

When Snapshot Isolation Fails to Prevent Write Skew

Snapshot isolation prevents many concurrency bugs but still allows the subtle write‑skew anomaly. This article explains why, shows real‑world examples, and offers concrete mitigation techniques.

May 18, 2026 · 8 min · 1581 words · martinuke0
Feedback