Constant-Time Root Scanning for Deterministic Garbage Collection
No abstract available.
Related papers
- Generational Stack Collection and Profile-Driven Pretenuring PLDI 1998
- Revisiting Partial Tracing for Safe, Efficient, and Concurrent Garbage Collection in Unmanaged Languages PLDI 2026
- Optimal heap limits for reducing browser memory use OOPSLA 2022
- Adaptive scanning reduces sweep time for the Lisp2 mark-compact garbage collector ISMM 2013
- Combining Card Marking with Remembered Sets: How to Save Scanning Time ISMM 1998
- Concurrent, parallel garbage collection in linear time ISMM 2014
- Arborescent Garbage Collection: A Dynamic Graph Approach to Immediate Cycle Collection ISMM 2025
- Garbage Collection and Local Variable Type-Precision and Liveness in Java Virtual Machines PLDI 1998