Adaptive Tuning of Reserved Space in an Appel Collector

Velasco, Josè M.; Olcoz, Katzalin; Tirado, Francisco

doi:10.1007/978-3-540-24851-4_25

Cited by 5 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Velasco et al make use of the same observation as this work [12]. They determine that the survival rate of collections is far below the space normally allocated to the copy reserve in an Appel style collector.…”

Section: Reduced Copy Reservementioning

confidence: 98%

Reducing generational copy reserve overhead with fallback compaction

McGachey

Hosking

2006

Proceedings of the 5th International Symposium on Memory Management

View full text Add to dashboard Cite

As programming languages with managed runtimes become increasingly popular, it is essential that virtual machines are implemented efficiently. The performance of the memory management subsystem can be a defining factor in the performance of the virtual machine as a whole. We present a technique by which garbage collector performance can be improved.We describe an algorithm that combines a standard generational copying collector with a mark and compact collector. We observe that, since most objects do not survive a garbage collection, it is not necessary to reserve space to copy them all. The result is a generational copying collector that operates with a smaller copy reserve overhead than traditional Appel-style collectors. We maintain correctness in the worst case through the use of mark and compact collection. When the reduced copy reserve overflows, a compacting phase ensures that all data are accommodated.We have implemented this algorithm within the framework of Jikes RVM and MMTk. For most benchmarks examined, our experiments show that performance is comparable to or better than a standard generational copying collector.

show abstract

Section: Reduced Copy Reservementioning

confidence: 98%

Reducing generational copy reserve overhead with fallback compaction

McGachey

Hosking

2006

Proceedings of the 5th International Symposium on Memory Management

View full text Add to dashboard Cite

show abstract

“…However, as suggested in [6] and [7], the amount of live objects to be copied can be significantly smaller than the reserved space. The live object size of a typical program would normally not exceed a certain maximum value and it will waste space if we reserve more space than this value.…”

Section: Live Objects and Their Sizesmentioning

confidence: 99%

“…It would not always reserve enough space for copying all the live objects, and when there is not enough memory, it compacts the nursery. [6] and [7] implement similar strategies for Appel-style generational collectors. The three collectors above are very similar to our skew-space collector, but our collector has the following merits:…”

Section: Space Efficient Collectorsmentioning

confidence: 99%

See 1 more Smart Citation

Exploiting memory usage patterns to improve garbage collections in Java

Tong

Lau

2010

Proceedings of the 8th International Conference on the Principles and Practice of Programming in Java

View full text Add to dashboard Cite

Copying-based garbage collectors are currently widely employed in JVM systems, as they provide not only cheap allocations but also fast collections. Comparing to their compacting-based counterparts, copying-based collectors trade space for time: they conservatively reserve half of the available heap for the purpose of copying live objects.1 It is a common belief, however, that objects' survival rates are generally too low to make full use of the reserved memory. We find through experiments that the total live object sizes of Java programs are generally small and remain relatively stable over many collections, which provides a perfect opportunity for optimization. We analyze this phenomenon and propose a "skew-space" 2 collector that would reserve spaces of dynamically adjusted sizes coming from online predictions. The proposed collector has been realized using MMTk in the JikesRVM, and has shown promising improvements in the total execution time for the SPECjvm98 and DaCapo benchmarks.

show abstract

“…Work by Velasco et al [27,26] reports that the volume of surviving objects from the nursery during minor collection rarely exceeds 20% of the nursery; however, a collector often reserves 100% of the nursery to ensure successful minor collection. Their technique leverages information from prior GC invocations to safely reduce the size of the copy-reserve space.…”

Section: Related Workmentioning

confidence: 99%

Investigating the effects of using different nursery sizing policies on performance

Guan

Srisa-an

Jia

2009

Proceedings of the 2009 International Symposium on Memory Management

View full text Add to dashboard Cite

In this paper, we investigate the effects of using three different nursery sizing policies on overall and garbage collection performances. As part of our investigation, we modify the parallel generational collector in HotSpot to support a fixed ratio policy and heap availability policy (similar to that used in Appel collectors), in addition to its GC Ergonomics policy. We then compare the performances of 15 large and small multithreaded Java benchmarks; each is given a reasonably sized heap and utilizes all three policies. The result of our investigation indicates that many benchmarks are sensitive to heap sizing policies, resulting in overall performance differences that can range from 1 percent to 36 percents. We also find that in our server application benchmarks, more than one policy may be needed. As a preliminary study, we introduce a hybrid policy that uses one policy when the heap space is plentiful to yield optimal performance and then switches to a different policy to improve survivability and yield more graceful performance degradation under heavy memory pressure.

show abstract

Adaptive Tuning of Reserved Space in an Appel Collector

Cited by 5 publications

References 10 publications

Reducing generational copy reserve overhead with fallback compaction

Reducing generational copy reserve overhead with fallback compaction

Exploiting memory usage patterns to improve garbage collections in Java

Investigating the effects of using different nursery sizing policies on performance

Contact Info

Product

Resources

About