An efficient on-the-fly cycle collection

@article{Paz2007AnEO,
  title={An efficient on-the-fly cycle collection},
  author={Harel Paz and David F. Bacon and Elliot K. Kolodner and Erez Petrank and V. T. Rajan},
  journal={ACM Trans. Program. Lang. Syst.},
  year={2007},
  volume={29},
  pages={20}
}
A reference-counting garbage collector cannot reclaim unreachable cyclic structures of objects. Therefore, reference-counting collectors either use a backup tracing collector infrequently, or employ a cycle collector to reclaim cyclic structures. We propose a new concurrent cycle collector, one that runs concurrently with the program threads, imposing negligible pauses (of around 1ms) on a multiprocessor. Our new collector combines a state-of-the-art cycle collector [Bacon and Rajan 2001] with… 
Efficient Concurrent Mark-Sweep Cycle Collection
Since 1960, reference counting has been a popular means of garbage collection. Reference counters achieve low pause times by using local data to determine liveness, but the use of this local data
A simple and efficient algorithm for cycle collection
TLDR
A new "lightweight" cyclic reference counting algorithm, which is based on partial tracing and deals with the cycle problem in a simpler and more efficient way by exploiting the lightweight hypothesis that considers a single sub-graph, instead of individual cycles, as the basic unit of cycle collection.
TR-CS-09-02 Efficient Concurrent Mark-Sweep Cycle Collection
Since 1960, reference counting has been a popular means of ga rbage collection. Reference counters achieve low pause times by u sing local data to determine liveness, but the use of this local da t
An efficient approach to cyclic reference counting based on a coarse-grained search
TLDR
This paper presents an efficient approach to cyclic reference counting, consisting of a coarse-grained cycle collection algorithm that essentially performs a coarser analysis of the computation graph and thus greatly reduces the tracing cost, and a predefined backup algorithm incorporated to eliminate a theoretical problem that appears in the coarse- grained algorithm.
Concurrent, parallel garbage collection in linear time
TLDR
A new concurrent garbage collection algorithm based on two types of reference, strong and weak, to link the graph of objects, which is linear in total time and can run in parallel with a live system without "stopping the world".
Efficient Memory Management for Servers
TLDR
The ageoriented collector is introduced, which exploits the generational hypothesis best when used with reference counting, to obtain highly efficient collection and a new onthe-fly cycle collection algorithm to accompany the reference-counting sliding-views collector.
Biased reference counting: minimizing atomic operations in garbage collection
TLDR
A novel algorithm called Biased Reference Counting (BRC) is proposed, which significantly improves the performance of non-deferred RC, and is implemented in the Swift programming language runtime and evaluated with client and server programs.
Cyclic reference counting by typed reference fields
TLDR
This paper introduces a novel classification model to predict the behavior of objects precisely and proposes an enhancement for cyclic reference counting algorithms by utilizing strongly-typed reference features of the Java language.
Adaptive optimization of the Sun Java™ real-time system garbage collector
TLDR
A framework for dynamically adapting the StartupMemoryThreshold for achieving the optimal balance between the application's throughput and pause time is presented, which was integrated into the beta release of Java RTS 2.2.
The Garbage Collection Handbook: The art of automatic memory management
TLDR
The Garbage Collection Handbook: The Art of Automatic Memory Management brings together a wealth of knowledge gathered by automatic memory management researchers and developers over the past fifty years and addresses new challenges to garbage collection made by recent advances in hardware and software.
...
1
2
3
...

References

SHOWING 1-10 OF 92 REFERENCES
An Efficient On-the-Fly Cycle Collection
TLDR
A new concurrent cycle collector is proposed, i.e., one that runs concurrently with the program threads, imposing negligible pauses (of around 1ms) on a multiprocessor, and eliminates the theoretical termination problem that appeared in the previous concurrent cycle collection.
Efficient Onthe-Fly Cycle Collection
A reference counting garbage collector cannot reclaim unreachable cyclic structures of objects. Therefore, reference counting collectors either use a backup tracing collector seldom, or employ a
Concurrent Cycle Collection in Reference Counted Systems
TLDR
A novel cycle collection algorithm that is both concurrent -- it is capable of collecting garbage even in the presence of simultaneous mutation -- and localized--it never needs to perform a global search of the entire data space.
An on-the-fly reference-counting garbage collector for java
TLDR
A novel reference-counting algorithm suitable for a multiprocessor system that does not require any synchronized operation in its write barrier (not even a compare-and-swap type of synchronization) and allows eliminating a large fraction of thereference-count updates, thus, drastically reducing the reference- Counting traditional overhead.
Integrating generations with advanced reference counting garbage collectors
TLDR
It turns out that a modern reference counting collector may benefit from the use of generations, and a new collector appropriate for running on a multiprocessor is designed.
Integrating Generations with Advanced Reference Counting Garbage Collectors
TLDR
This work proposes three designs for combining two on-the-fly collectors so that the reference counting collector collects the young generation or the old generation or both, and implements these algorithms with the Jikes JVM and compared them against the concurrentreference counting collector supplied with theJikes package.
An on-the-fly mark and sweep garbage collector based on sliding views
TLDR
A novel mark and sweep on-the-fly algorithm based on the sliding views mechanism of Levanoni and Petrank that outperforms the Jikes concurrent collector by up to 60% and may be used as a backup collector for the LeVanoni-Petrank reference counting collector.
An on-the-fly mark and sweep garbage collector based on sliding views
TLDR
A novel mark and sweep on-the-fly algorithm based on the sliding views mechanism of Levanoni and Petrank that outperforms the Jikes concurrent collector by up to 60% and may be used as a backup collector for the LeVanoni-Petrank reference counting collector.
A generational on-the-fly garbage collector for Java
TLDR
Comparing the incorporation of generations into an on-the-fly collector with and without generations, it turns out that the generational collector performs better for most applications.
Age-Oriented Concurrent Garbage Collection
TLDR
A new collection approach is proposed, denoted age-oriented collection, for exploiting the generational hypothesis to obtain better efficiency, particularly useful when reference counting is used to collect the old generation, yielding a highly efficient and non-obtrusive on-the-fly collector.
...
1
2
3
4
5
...