Garbage collection

Known as: Garbage collector, 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

Topic mentions per year

Topic mentions per year

1967-2017
05010015019672017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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
Because dynamic memory management is an important part of a large class of computer programs, high-performance algorithms for… (More)
  • figure 1
  • table I
  • table II
  • figure 2
  • table III
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
1984
Highly Cited
1984
This paper discusses garbage collection techniques used in a high-performance Lisp implementation with a large virtual memory… (More)
Is this relevant?
Highly Cited
1977
Highly Cited
1977
<bold>This paper investigates some problems associated with an argument evaluation order that we call &#8220;future&#8221; order… (More)
Is this relevant?
Highly Cited
1975
Highly Cited
1975
Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. The simple case of two processors… (More)
  • table I
Is this relevant?
Highly Cited
1975
Highly Cited
1975
As an example of cooperation between sequential processes with very little mutual interference despite frequent manipulations of… (More)
Is this relevant?