Sign up & Download
Sign in

Garbage Collection of Linked Data Structures

by Jacques Cohen, Jacques Cohen
Computing Surveys ()


A concise and unified view of the numerous existing algorithms for performing garbage collection of linked data structures is presented. The emphasis is on garbage collection proper, rather than on storage allocation. First, the classical garbage collection algorithms are , and their marking and collecting phases, with and without compacting, are discussed. Algorithms describing these phases are classified according to the type of cells to be collected = "those for collecting single-sized cells are simpler than those for varisized cells. Recently proposed algorithms are presented and compared with the classical ones. Special topics in garbage collection are also covered. A bibliography with topical annotations is included

Cite this document (BETA)

Readership Statistics

1 Reader on Mendeley
by Discipline
by Academic Status
100% Ph.D. Student


Sign up today - FREE

Mendeley saves you time finding and organizing research. Learn more

  • All your research in one place
  • Add and import papers easily
  • Access it anywhere, anytime

Start using Mendeley in seconds!

Already have an account? Sign in