A performance study of software prefetching for tracing garbage collectors

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In automatic memory management programming language, the garbage collector is an important feature which reclaims memory that is no longer referenced by the program. The tracing collector performs a transitive closure across the object reference graph. And this process may result in too many cache misses, because the traverse exhibits poor locality. Previous studies have already proposed using software prefetching to improve memory performance of garbage collector. In this work, we studied the characteristic of prefetch instructions on x86 platforms in detail, and proposed a method to control the prefetch ratios by address thresholds. The experimental results show that a further improvement and optimization is obtained by tuning the prefetch ratio. We use these results to devise some guidelines for optimizing the memory performance as well as minimizing the collection pause times. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Wu, H., Ji, Z., Zhu, S., & Chen, Z. (2013). A performance study of software prefetching for tracing garbage collectors. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8299 LNCS, pp. 160–169). https://doi.org/10.1007/978-3-642-45293-2_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free