Minimal overhead garbage collection of complex list structure

Authors:
David Spector
Affiliations:
MS 10B-17-3, Prime Computer, Inc., Framingham, Massachusetts
Venue:
ACM SIGPLAN Notices
Year:
1982

Citing 1
Cited 2

Managing Reentrant Structures Using Reference Counts

ACM Transactions on Programming Languages and Systems (TOPLAS)

Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
Distributed garbage collection

SIGPLAN '87 Papers of the Symposium on Interpreters and interpretive techniques

Quantified Score

Hi-index	0.00

Visualization

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.