Title :
A Space-Efficient List Structure Tracing Algorithm
Author_Institution :
Center for Research in Computing Technology, Harvard University, Cambridge, Mass.
Abstract :
An algorithm for tracing during garbage collection of list structure is presented. It requires only one bit for each level of doubly branching structure traced. Compared to existing trace algorithms, it generally requires less storage¿often, substantially less.
Keywords :
Boolean functions; Contracts; Counting circuits; Electrons; Minimization methods; Switching circuits; Free storage management; garbage collection; list processing; list tracing; storage reclamation; storage regeneration;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1972.5009079
