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.
Cite
CITATION STYLE
Boehm, H. J., Demers, A. J., & Shenker, S. (1991). Mostly parallel garbage collection. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (pp. 157–164). Association for Computing Machinery. https://doi.org/10.1145/113445.113459
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
