Name
Abstract | ||
|---|---|---|
This paper discusses thread-local garbage collection (GC), a technique of automatic memory management aimed at improving GC throughput and reducing GC pauses in managed runtimes. It exploits the observation that most objects do not escape the scope of the thread allocated them; therefore, memory occupied by these objects can be reclaimed locally within the thread. The question is how to efficiently compute this property at run time while achieving a good tradeoff between the precision of necessary dynamic analysis and the implied overheads for application performance. This paper gives a formal definition of thread-local reachability in the heap graph and proposes several strategies to compute it. Having implemented these strategies in a Java virtual machine, we present results of quantitative evaluation of the amount of thread-local objects discovered with a representative test suite of modern Java applications. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1134/S0361768819010043 | Programming and Computer Software |
Field | DocType | Volume |
Programming language,Computer science,Thread (computing),Theoretical computer science,Garbage collection,Java | Journal | 45 |
Issue | ISSN | Citations |
1 | 0361-7688 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| A. Yu. Filatov | 1 | 0 | 0.34 |
| V. V. Mikheev | 2 | 0 | 0.34 |