Going Where No GC Has Gone Before

on YouTube ↗25m

" summary

Language and GC co‑design for Bosque pairs a copy‑nursery with reference counting in old space, conservative root scanning, an 8 MB nursery and an ~2.4K‑LOC collector implementation. Claim: the system achieves provably bounded pauses, fixed‑constant memory overhead and starvation freedom because no mutation or cycles exist. Benchmarks (200–5,000 LOC) show ~7% GC overhead, microsecond median and constrained 99th‑percentile pauses; wall‑clock is slower than ZGC/Shenandoah on unlimited heaps but remains stable under tight 1.5× memory limits.

AI-written summary · about

" chapters (11)

1. 0:00Bossi introduction and goals
2. 1:55Bossi breaks from tradition
3. 3:18Core language simplifications
4. 5:25New GC needed for Bossi
5. 7:29GC theoretical limits and Bossi’s edge
6. 10:37GC for immutable cycle-free data
7. 13:27New GC bounded pause times
8. 15:56GC implementation and benchmarks
9. 18:24Bossi GC vs Java ZGC Shenandoah
10. 20:11Language runtime design implications
11. 21:59Q&A