A Space-Efficient List Structure Tracing Algorithm
Abstract
The note presents an algorithm for tracing during garbage collection of list structure. 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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1972
- Accession Number
- AD0758204
Entities
People
- Ben Wegbreit
Organizations
- Harvard University