Garbage collection (computer science)

Known as: Garbage collector (computer science), Tri-colour marking, Computer memory garbage collection 
In computer science, garbage collection (GC) is a form of automatic memory management. The garbage collector, or just collector, attempts to reclaim… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2004
Highly Cited
2004
<i>Garbage-First</i> is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
This paper explores and quantifies garbage collection behavior for three whole heap collectors and generational counterparts… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
The complexity of systems for automatic control and other safety-critical applications grows rapidly. Computer software… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.2
  • figure 4.1
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Spend your few moment to read a book even only few pages. Reading book is not obligation and force for everybody. When you don't… (More)
Is this relevant?
Highly Cited
1994
Highly Cited
1994
We describe and prove the correctness of a new concurrent mark-and-sweep garbage collection algorithm. This algorithm derives… (More)
Is this relevant?
Highly Cited
1993
Highly Cited
1993
We have implemented the first copying garbage collector that permits continuous unimpeded mutator access to the original objects… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Generational garbage collection algorithms achieve efficiency because newer records point to older records; the only way an older… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Hans-Juergen Boehm Computer Science Department, Rice University, Houston, TX 77251-1892, U.S.A. Mark Weiser Xerox Corporation… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A very old and simple algorithm for garbage collection gives very good results when the physical memory is much larger than the… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of… (More)
Is this relevant?