Minimal overhead garbage collection of complex list structure

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimal overhead garbage collection of complex list structure

Full text

Pdf (201 KB)

Source

ACM SIGPLAN Notices archive
Volume 17 , Issue 3 (March 1982) table of contents

Pages: 80 - 82

Year of Publication: 1982

ISSN:0362-1340

Author

David Spector

MS 10B-17-3, Prime Computer, Inc., Framingham, Massachusetts

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 2

Additional Information:

abstract references cited by collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/947912.947919 What is a DOI?

ABSTRACT

A method is described for keeping track of list cells and other objects so that they may be returned to free storage when they are no longer referenced. The method uses only one bit per reference and no searching.

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Daniel G. Bobrow, Managing Reentrant Structures Using Reference Counts, ACM Transactions on Programming Languages and Systems (TOPLAS), v.2 n.3, p.269-273, July 1980 [doi>10.1145/357103.357104]

CITED BY 2

	B Wah , G J Li, Survey on special purpose computer architectures for AI, ACM SIGART Bulletin
	J. D. Eckart , R. J. LeBlanc, Distributed garbage collection, ACM SIGPLAN Notices, v.22 n.7, p.264-273, July 1987

Collaborative Colleagues:

David Spector: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player