Mostly parallel garbage collection
Hans‐J. Boehm, Alan J. Demers, Scott J. Shenker · Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation · 1991
We present a method for adapting garbage collectors designed to run sequentially with the client, so that they may run concurrently with it.We rely on virtual memory hardware to provide information about pages that have been updated or "dirtied" during a given period of time.This method has been used to construct a mostly parallel trace-and-sweep collector that exhibits very short pause times.Performance measurements are given.
Cited by 208 works. doi:10.1145/113445.113459 Open-access PDF
Authors
References
- On-the-fly garbage collection
- Generation Scavenging
- Garbage collection in a large LISP system
- Garbage collection in an uncooperative environment
- Multiprocessing compactifying garbage collection
- Performance and Evaluation of LISP Systems
- A nonrecursive list compacting algorithm
- Virtual memory primitives for user programs
- Real-time concurrent collection on stock multiprocessors
- The portable common runtime approach to interoperability