A Space-Efficient List Structure Tracing Algorithm
HARVARD UNIV CAMBRIDGE MA
Pagination or Media Count:
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.
- Computer Programming and Software
- Computer Hardware
- Computer Systems Management and Standards