Garbage Collection of Linked Data Structures

@article{Cohen1981GarbageCO,
  title={Garbage Collection of Linked Data Structures},
  author={Jacques Cohen},
  journal={ACM Comput. Surv.},
  year={1981},
  volume={13},
  pages={341-367}
}
A concise and unified view of the numerous existing algorithms for performing garbage collection of linked data structures is presented. The emphasm is on garbage collection proper, rather than on storage allocatlon. First, the classical garbage collection algorithms are reviewed, and their marking and collecting phases, with and without compacting, are discussed. Algorithms descnbing these phases are classified according to the type of cells to be collected: those for collecting single-sized… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.

FILTER CITATIONS BY YEAR

1982
2018

CITATION STATISTICS

  • 10 Highly Influenced Citations

  • 100% Increase in citations per year in 2018 over 2017

Similar Papers

Loading similar papers…