Algorithms for on-the-fly garbage collection
M Ben-Ari - ACM Transactions on Programming Languages and …, 1984 - dl.acm.org
ACM Transactions on Programming Languages and Systems (TOPLAS), 1984•dl.acm.org
A new algorithm is described for on-the-fly garbage collection. The new algorithm uses only
two colors and has a simple correctness proof. Two variations on the algorithm are then
derived: One attempts to minimize the amount of marking that must be done, and the other is
an incremental garbage collector.
two colors and has a simple correctness proof. Two variations on the algorithm are then
derived: One attempts to minimize the amount of marking that must be done, and the other is
an incremental garbage collector.
A new algorithm is described for on-the-fly garbage collection. The new algorithm uses only two colors and has a simple correctness proof. Two variations on the algorithm are then derived: One attempts to minimize the amount of marking that must be done, and the other is an incremental garbage collector.
ACM Digital Library