Authors

Paul Wilson

Description

We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between storage management systems, languages, and compilers. Throughout, we attempt to present a unified view based on abstract traversal strategies, addressing issues of conservatism, opportunism, and immediacy of reclamation; we also point out a variety of implementation details that are likely to have a significant impact on performance.

Date of creation, presentation, or exhibit

1992

Comments

Lecture Notes In Computer Science 637 (1992) 1-42 Copyright 1992 Springer-Verlag. All Rights Reserved. The original publication is available at www.springerlink.com . The publication is also available at http://portal.acm.org/citation.cfm?id=664824&dl=ACM&coll=portal ISBN: 3-540-55940-XNote: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works in February 2014.

Document Type

Conference Proceeding

Department, Program, or Center

School of Mathematical Sciences (COS)

Campus

RIT – Main Campus

Share

COinS