Mostly parallel garbage collection
- 1 May 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (6) , 157-164
- https://doi.org/10.1145/113446.113459
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- Virtual memory primitives for user programsPublished by Association for Computing Machinery (ACM) ,1991
- A module system for schemePublished by Association for Computing Machinery (ACM) ,1990
- Combining generational and conservative garbage collection: framework and implementationsPublished by Association for Computing Machinery (ACM) ,1990
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988
- Real-time concurrent collection on stock multiprocessorsPublished by Association for Computing Machinery (ACM) ,1988
- Performance and Evaluation of LISP SystemsPublished by MIT Press ,1985
- Garbage collection in a large LISP systemPublished by Association for Computing Machinery (ACM) ,1984
- On-the-fly garbage collectionCommunications of the ACM, 1978
- Multiprocessing compactifying garbage collectionCommunications of the ACM, 1975
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970