An on-the-fly reference counting garbage collector for Java

LevanoniYossi,; PetrankErez,

doi:10.1145/504311.504309

Cited by 25 publications

(46 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Suppose SCC k is the first reachable SCC processed by CollectGarbage. At lines (3)(4)(5)(6)(7)(8)(9) of CollectGarbage, it is easy to see that for every 1 ≤ i < k, SCC i has been discovered to be garbage and collected; and for every k < j ≤ n, SCC j is ignored. Also, for every k < j ≤ n, SCC j must be reachable.…”

Section: Proofmentioning

confidence: 99%

See 1 more Smart Citation

A Single-Trace Cycle Collection for Reference Counting Systems

Hou

Lin

2009

2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks

View full text Add to dashboard Cite

The lack of collecting cyclic garbage is generally considered the major weakness of reference counting. Reference counted systems handle this problem by incorporating either a global tracing collector or a partial tracing collector that considers only the cycle candidates. The latter has become a preferred one as it has better scalability and locality. Most of the partial tracing collectors are based on a classical tracing scheme, called trial deletion, which needs several traces over objects and thus may impose more overhead on tracing. Though lots of works have focused on reducing unnecessary candidates for tracing, few studies resort to the cycle collection procedure. This paper presents a novel cycle collection algorithm which can detect garbage cycles in a single trace over cycle candidates. The algorithm and the correctness proof are described in detail.

show abstract

Section: Proofmentioning

confidence: 99%

“…Bacon et al [1,2] improved Lins' algorithm by analyzing the entire graph of all the candidates simultaneously; the number of traced objects is reduced. In [15], the sliding views technique [7] was incorporated into Bacon and Rajan's previous work [1], which further filters out unnecessary candidates.…”

Section: Introductionmentioning

confidence: 99%

A Single-Trace Cycle Collection for Reference Counting Systems

Hou

Lin

2009

2009 10th International Symposium on Pervasive Systems, Algorithms, and Networks

View full text Add to dashboard Cite

show abstract

“…Levanoni and Petrank [18] have taken another approach to attacking the excessive synchronization of most other garbage collectors. Their approach is designed to avoid synchronization as much as possible: they even eschew the use of CAS.…”

Section: Related Workmentioning

confidence: 99%

Lock-free reference counting

Detlefs¹,

Martin²,

Moir³

et al. 2002

Distributed Computing

100

View full text Add to dashboard Cite

Assuming the existence of garbage collection makes it easier to design implementations of dynamic-sized concurrent data structures. However, this assumption limits their applicability. We present a methodology that, for a significant class of data structures, allows designers to first tackle the easier problem of designing a garbage-collection-dependent implementation, and then apply our methodology to achieve a garbage-collection-independent one. Our methodology is based on the well-known reference counting technique, and employs the double compare-and-swap operation.

show abstract

“…We leave the implementation of getLref to the implementor. For algorithm B, getLref (m) has to construct an atomic snapshot of m.Lref , just as in [7,13].…”

Section: Introductionmentioning

confidence: 99%

“…There are several recent studies on reference counting concurrent collectors, e.g., [4,13]. A disadvantage of reference counting collectors is that they do not collect all cycles.…”

Section: Introductionmentioning

confidence: 99%

Simple concurrent garbage collection almost without synchronization

Hesselink

Lali

2009

Form Methods Syst Des

View full text Add to dashboard Cite

We present two simple mark and sweep algorithms, A and B, for concurrent garbage collection by a single collector running concurrently with a number of mutators that concurrently modify shared data. Both algorithms are based on the ideas of Ben-Ari's classical algorithm for on-the-fly garbage collection with one mutator. The algorithms require the mutators to estimate the set of objects they currently hold in private variables. They differ in the grain of atomicity of this estimate and in their mutator marking requirements.For algorithm A, the only synchronization needed is at the point where the list of newly collected garbage nodes is included in the free list to again become available to the mutators. Such synchronization of access to the free list seems unavoidable. For algorithm A, the estimate can be constructed concurrently with mutator actions. Algorithm B requires that the estimate is constructed atomically.Algorithms of this form have always been error-prone. We therefore provide assertional proofs of correctness, which moreover have been verified with the proof assistant PVS.

show abstract

An on-the-fly reference counting garbage collector for Java

Cited by 25 publications

References 35 publications

A Single-Trace Cycle Collection for Reference Counting Systems

A Single-Trace Cycle Collection for Reference Counting Systems

Lock-free reference counting

Simple concurrent garbage collection almost without synchronization

Contact Info

Product

Resources

About