Distributed garbage collection

Known as: DGC 
Distributed garbage collection (DGC) in computing is a particular case of garbage collection where references to an object can be held by a remote… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Most distributed garbage collection (DGC) algorithms are not complete as they fail to reclaim distributed cycles of garbage… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
With the continued growth of distributed systems as a means to provide shared data, designers are turning their attention to… (More)
  • figure 8
  • figure 20
  • figure 25
  • figure 27
  • figure 29
Is this relevant?
1998
1998
This paper presents a new algorithm for distributed garbage collection and outlines its implementation within the Network Objects… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
In this report we show an algorithm for cyclic distributed garbage collection that does not require global coordination and is… (More)
Is this relevant?
1997
1997
1 Abstract This paper describes an algorithm for cyclic distributed garbage collection and its implementation. The algorithm is… (More)
  • figure 2
  • figure 3
  • figure 6
Is this relevant?
Review
1995
Review
1995
We present the spectrum of distributed garbage collection techniques. We ›rst describe those reference countingbased techniques… (More)
  • figure 9
  • figure 13
  • figure 15
  • figure 17
Is this relevant?
1994
1994
One of the key features of modern high level programming languages is the automatic allocation and reclaimation of space for data… (More)
  • figure 4
  • figure 5
  • figure 6
  • figure 7
  • figure 8
Is this relevant?
1992
1992
Concurrent Scheme extends the Scheme programming language providing par allel program execution on a distributed network The… (More)
  • figure 4.8
Is this relevant?
1992
1992
Automatic storage management is important in highly parallel programming environments where large numbers of objects and… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
This paper describes two techniques that are only loosely related. The first is a method for constructing a highly available… (More)
Is this relevant?