Garbage Collection, State of the Art
summary
Covers how garbage-collected memory is organized and managed (stack, heap, arenas, reference counting, GC, compaction), contrasts managed vs off‑heap memory, and explains common GC techniques and terms such as root scanning, exact vs conservative, mark-sweep/mark-compact/mark-copy, generational, incremental, concurrent, parallel, real-time, and write barriers. Describes the GC implementations and key tuning parameters in JDK, V8, and Go, discusses compiler/runtime requirements for GC, and gives techniques for writing code that coexists well with a GC.
AI-written summary · about
chapters (18)
- 0:00Introduction
- 2:05What is memory garbage?
- 5:12Stop-the-world latency
- 8:43Root discovery and marking
- 12:53Sweeping and compaction
- 17:26Copying collection
- 21:58Free memory allocation
- 26:06Latency reduction
- 29:13Generational hypothesis
- 33:28Barriers and remember sets
- 37:17Memory regions
- 40:04Concurrent collection
- 45:58Technique summary
- 46:19Go: concurrent collector
- 48:24V8: generational collector
- 49:48Java: traditional collector
- 51:14Java: G1 improvements
- 53:01ZGC and Shenandoah
related talks
50mAn insight into Go Garbage Collection
52mGarbage collection for the humans
50mTrash Talk - Exploring the JVM memory management
51mJava Garbage Collection - The Basics
32mThe Evolution of Garbage Collection Algorithms in Java
46mTrash Talk - Exploring the Memory Management in the JVM
01mThe evolution of Garbage Collection Algorithms in Java
25mGarbage Collection Primer