Garbage Collection of Linked Data Structures

by Jacques Cohen
Computing Surveys ()
  • ISSN: 00104892

Abstract

A concise and unified view of the numerous existing algorithms for\nperforming garbage collection of linked data structures is presented. The\nemphasis is on garbage collection proper, rather than on storage\nallocation.\nFirst, the classical garbage collection algorithms are , and their\nmarking and collecting phases, with and without compacting, are\ndiscussed.\nAlgorithms describing these phases are classified according to the type of\ncells to be collected = "those for collecting single-sized cells are simpler than\nthose for varisized cells. Recently proposed algorithms are presented and\ncompared with the classical ones. Special topics in garbage collection are\nalso covered. A bibliography with topical annotations is included

Cite this document (BETA)

Readership Statistics

6 Readers on Mendeley
by Discipline
 
by Academic Status
 
33% Ph.D. Student
 
33% Doctoral Student
 
17% Researcher (at an Academic Institution)
by Country
 
17% Germany
 
17% Colombia

Tags

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!

Sign up & Download

Already have an account? Sign in