Uniprocessor garbage collection techniques

Show simple item record

dc.contributor.author Wilson, Paul en_US
dc.date.accessioned 2007-10-18T03:14:59Z en_US
dc.date.available 2007-10-18T03:14:59Z en_US
dc.date.issued 1992 en_US
dc.identifier.citation Lecture Notes In Computer Science 637 (1992) 1-42 en_US
dc.identifier.isbn 3-540-55940-X en_US
dc.identifier.uri http://hdl.handle.net/1850/5112 en_US
dc.description 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 en_US
dc.description.abstract 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. en_US
dc.description.sponsorship None en_US
dc.language.iso en_US en_US
dc.publisher Springer-Verlag en_US
dc.relation.ispartofseries vol. 637 en_US
dc.title Uniprocessor garbage collection techniques en_US
dc.type Proceedings en_US

Files in this item

Files Size Format View
PWilsonProceedings1992.pdf 660.6Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

Search RIT DML


Advanced Search

Browse