Garbage Collection

Diagram of tri‑color marking stages overlaid on a memory heap.

Implementing Concurrent Garbage Collection: Deep Dive into Tri-Color Marking for Low-Latency Memory Management

A practical guide to building a concurrent garbage collector using tri‑color marking, covering core invariants, integration with JVM and Go runtimes, and real‑world performance tuning.

Illustration of memory generations with objects being promoted and collected.

Why Short-Lived Objects Die Young in Modern GCs

Modern GCs favor short-lived objects, reclaiming them within milliseconds. This post explains the underlying algorithms, runtime optimizations, and practical coding tips.

Illustration of two memory semispaces with objects being copied.

Why Cheney Semispace Copying Prevents Heap Fragmentation

Explore why Cheney’s semispace copying algorithm inherently prevents heap fragmentation, how it works under the hood, and what trade‑offs developers should consider.

Illustration of two memory semispaces with arrows indicating copying.

The Mechanical Reality of Cheney Semispace Copying

Discover how Cheney’s semispace copying algorithm works under the hood, why it matters for modern runtimes, and what pitfalls to avoid when implementing it.

Illustration of memory generations with objects moving between them.

Why Most Objects Die Young in Generational Garbage Collection

A deep dive into the reasons behind the high mortality of objects in generational GC, the mechanisms that make it efficient, and practical tips for developers.