Every GC algorithm Java has ever shipped: Serial, Parallel, CMS, G1, ZGC, Shenandoah. Mark/Sweep/Compact from first principles, the generational hypothesis, remembered sets, load barriers, and how to tune each collector for your workload.
// Lessons
- 01soon
GC from First Principles — The Reachability Problem
- 02soon
Mark, Sweep and Compact — The Three Phases
- 03soon
The Generational Hypothesis — Why Generations Exist
- 04soon
Serial GC — Single-Threaded Collection for Small Heaps
- 05soon
Parallel GC — Multi-Threaded Stop-the-World for Throughput
- 06soon
CMS — Concurrent Mark Sweep (The History That Shaped G1)
- 07soon
G1GC — Regions, Remembered Sets and Concurrent Marking
- 08soon
G1GC — Mixed Collections, Humongous Objects and Evacuation Failure
- 09soon
ZGC — Load Barriers, Colored Pointers and Concurrent Relocation
- 10soon
Shenandoah — Brooks Pointers and Concurrent Compaction
- 11soon
GC Tuning — Reading Logs, JVM Flags and Pause Optimization
- 12soon
Diagnosing GC Problems — Allocation Storms, Promotion Failure, Full GC