Home > lambdatheultimate > Leveled Garbage Collection

Leveled Garbage Collection

March 5th, 2011 03:00 admin Leave a comment Go to comments

Leveled Garbage Collection by Guanshan Tong and Michael J. O’Donnell:

Generational garbage collection (GGC) is one of the most popular garbage collection techniques. GGC gains a performance advantage by performing minor collections on the younger objects in the heap, reducing the number of major collections of the whole heap. A promotion policy determines when an object moves from the younger generation to the older. The design of GGC has been justified by the plausible assumption that many objects die very young, and a few live a very long time. But, attempts to tune the performance of GGC by adjusting the promotion policy have been disappointing – only the simplest immediate promotion policy has proved attractive. The success of GGC is probably due to simplicity and to avoiding scans of the whole heap, rather than to accurate lifetime predictions.

This paper presents Leveled Garbage Collection (LGC), a new algorithm that is not based on object ages. It uses a heap structure and collection scheme similar to those of generational garbage collectors, and has a non-age-based promotion policy that doesn’t promote all of the live objects, but still guarantees ample free space immediately after each garbage collection. By tuning LGC’s promotion policy, we can often improve on GGC with immediate promotion.

Performance comparisons show that LGC outperforms GGC with immediate promotion policy in many cases, while losing only slightly on cases favorable to immediate promotion. LGC has a substantial advantage when the heap fits in main memory, and an even greater advantage as the heap gets paged to disk.

Leveled GC is based on a more general heuristic than generational GC, in that it tries to keep as many objects as possible in the nursery because minor collections are so much cheaper. What I found most interesting about this paper is that it scales well with virtual memory, which as we know can degrade performance significantly. They provide benchmarks demonstrating a marked difference when large heap sizes trigger paging (Section 5.2.2). LGC performance is hardly affected, while the runtime of generational GC degrades significantly.

Source: Leveled Garbage Collection

Related Articles:

  1. One Pass Real-Time Generational Mark-Sweep Garbage Collection
  2. Heap space analysis for garbage collected languages
  3. Heap space analysis for garbage collected languages
  4. Heap space analysis for garbage collected languages
  5. Heap space analysis for garbage collected languages
blog comments powered by Disqus
YOYOYOOYOYOYO