Garbage Collection for Mostly Serialized Heaps
summary
A hybrid generational collector for mostly-serialized heaps implements a nursery of mini-regions with bump allocation and a copying young collector that evacuates into an old generation that uses region-level reference counting. The system targets Gibbon-style dense, byte-granular layouts, adds forwarding-pointer scanning plus side metadata for tiny objects, proves a theorem: minimal indirections after collection, and reports a 3.3x speedup on small-allocation benchmarks while keeping previous throughput on large traversals.
AI-written summary · about
chapters (14)
- 0:00Serialized heap GC intro
- 1:23Why serialized heaps matter
- 2:48Data representation impact
- 3:51Functional compilation challenges
- 5:17Region-based memory overview
- 7:21Reference counting weaknesses
- 8:43List reversal benchmark failure
- 9:26Generational GC introduction
- 10:51Copying to old generation
- 12:37Compaction in serialized heaps
- 13:19GC in cramped layouts
- 14:21Benchmark results
- 15:23Sharing with forwarding pointers
- 18:12Future work