Corpus ID: 12086982

A Pure Reference Counting Garbage Collector

  title={A Pure Reference Counting Garbage Collector},
  author={D. Bacon and C. R. Attanasio and Stephen E. Smith and H. Lee},
"!# $ % %& ' % %& ( ')* # " +, $ -. /0 !1 !2 "!# 43( 5 !2 6 4 '70 8 9% # +: !2 5 ; 9 8 4 / / , < !2 6 4 , $ =(>4?@ !2% ' 5 " 6 AB C * / 2 D # E ( 6 6F ') /8=HG ?@ !2 I $ D 7 J, K !2 L C/ /2 I %& 6 4 C+* # ,!5 6 4 L 2!5 % B M NH !2 ($ ( !2 '7O 8 <% C & % B , E C / 9 P %& !2 6 Q 4 " < PB K IR %& BS 2R 5 ( Q!# 6 7 8 <% C!2 ' !2 , !2% 5 * K ( K 5 NT K C% 6 U / N 8!# F NV / NT (+@ %0 = 4 2+@ 9 !2% !2 / WR %& BS B?6)* /W 4 9 ' . 6 / -8 & T+@ %& K !2 K /9 % '7 8% B D D!2 !2 ($9 I 5 !2 /U)& 2X, $ < $ D… Expand
On designing a low-power garbage collector for java embedded devices: a case study
An energy consumption comparison between two well-known garbage collection algorithms---mark-sweep-compact and reference counting---is presented, with the hybrid scheme requiring up to 59% less energy than the default KVM. Expand
Dynamic monitor allocation in the IBM J9 virtual machine
This thesis focuses on a dynamic approach for growing monitors for objects in order to reduce the memory footprint and improve the execution time of the IBM Java Virtual Machine. Expand
Computer Architecture and Parallel Systems Laboratory Massively Multi-Core Systems and Virtual Memory
The fundamental limits imposed by semiconductor technology have led to renewed interest in parallel computation, in order to achieve the maximum performance and energy efficiency of massivelyExpand
On the Feasibility of a Codelet Based Multi-core Operating System
  • J. Dennis, G. Gao
  • Computer Science
  • 2014 Fourth Workshop on Data-Flow Execution Models for Extreme Scale Computing
  • 2014
We believe it is feasible to build a multi-core operating system that implements virtual memory, and honors the principles of modular software construction, using runtime software that executes aExpand
Efficient Implementation Techniques for Block-Level Cloud Storage Systems
Of the Dissertation Efficient Implementation Techniques for Block-Level Cloud Storage Systems and how these techniques can be applied to dissertation implementation techniques for block-level cloud storage systems. Expand


An efficient parallel garbage collection system and ITS correctness proof
  • H. T. Kung, S. W. Song
  • Computer Science
  • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
  • 1977
An efficient system to perform garbage collection in parallel with list operations is proposed and its correctness is proven and results show that the parallel system is usually significantly more efficient in terms of storage and time than the sequential stack algorithm. Expand
A parallel, real-time garbage collector
This paper presents the extensions necessary for a practical implementation of a parallel, real-time garbage collector: reducing excessive interleaving, handling stacks and global variables, reducing double allocation, and special treatment of large and small objects. Expand
Generational stack collection and profile-driven pretenuring
This paper presents two techniques for improving garbage collection performance: generational stack collection and profile-driven pretenuring. The first is applicable to stack-based implementationsExpand
An on-the-fly reference-counting garbage collector for java
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. Expand
An efficient, incremental, automatic garbage collector
This paper describes a new way of solving the storage reclamation problem for a system such as Lisp that allocates storage automatically from a heap, and does not require the programmer to give anyExpand
Implementing an on-the-fly garbage collector for Java
Measurements show that the performance advantage for the collector increases as the number of threads increase and that it provides uniformly low response times, compared with stop-the-world mark-sweep GC. Expand
Concurrent Cycle Collection in Reference Counted Systems
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. Expand
Cyclic Distributed Garbage Collection with Group Merger
A new algorithm based on a reference listing scheme augmented by partial tracing in order to collect distributed garbage cycles, designed to be flexible thereby allowing efficiency, expediency and fault-tolerance to be traded against completeness. Expand
A generational on-the-fly garbage collector for Java
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. Expand
Managing Reentrant Structures Using Reference Counts
  • D. Bobrow
  • Computer Science
  • ACM Trans. Program. Lang. Syst.
  • 1980
This paper describes several ways of specifying group membership, properties of each implementation, and properties of mutable and immutable group membership. Expand