On effectiveness of GC in Java

Shaham, Ran; Kolodner, Elliot K.; Sagly, Mooly

doi:10.1145/362426.362430

Cited by 13 publications

(14 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In work concurrent to ours, Shaman et al [12] evaluate a conservative garbage collector using a limit study: They find that the conservative garbage collector is not effective in reclaiming objects in a timely fashion. However, unlike our work, they do not demonstrate if an accurate collector would be more effective in reclaiming objects.…”

Section: Related Workmentioning

confidence: 74%

See 1 more Smart Citation

On the type accuracy of garbage collection

Hirzel

Diwan

2000

Proceedings of the 2nd International Symposium on Memory Management

View full text Add to dashboard Cite

We describe a novel approach to obtaining type-accurate information for garbage collection in a hardware and language independent way. Our approach uses a run-time analysis to propagate pointer/non-pointer information from significant type events (such as allocation, which always returns a pointer). We use this technique to perform a detailed comparison of garbage collectors with different levels of accuracy and explicit deallocation on a range of C programs. We take advantage of the portability of our approach to conduct our experiments on three hardware platforms, Alpha/Digital UNIX 4.0D, Pentium/Linux 2.2, and SPARC/Solaris 2. We find that the choice of hardware platform (which includes the architecture, operating system, and libraries) greatly affects whether or not type accuracy enhances a garbage collector's ability to reclaim objects.

show abstract

Section: Related Workmentioning

confidence: 74%

“…Prior work, with the exception of a limit study [12], has investigated only intraprocedural liveness of local variables [2]. We are investigating the usefulness of interprocedural liveness information.…”

Section: Future Workmentioning

confidence: 99%

On the type accuracy of garbage collection

Hirzel

Diwan

2000

Proceedings of the 2nd International Symposium on Memory Management

View full text Add to dashboard Cite

show abstract

“…Their experiments were done on KVM using several Java applications for embedded systems. Shaham et al [Shaham et al 2000, 2001 examined the potential improvement of execution time by freeing dynamic memory at the earliest possible points. They developed a tool to rewrite application source code in a way that more timely garbage collection can be performed.…”

Section: Related Workmentioning

confidence: 99%

Shared heap management for memory-limited java virtual machines

Choi

Han

2008

ACM Trans. Embed. Comput. Syst.

View full text Add to dashboard Cite

One scarce resource in embedded systems is memory. Multitasking makes the lack of memory problem even worse. Most current embedded systems, which do not provide virtual memory, simply divide physical memory and evenly assign contiguous memory chunks to multiple applications. Such simple memory management can frequently cause the lack of available memory for some applications, while others are not using the full amount of assigned memory. To overcome inefficiency in current memory management, we present an efficient heap management scheme that allows multiple applications to share heap space. To reduce overall heap memory usage, applications adaptively acquire subheaps out of shared pool of memory and release surplus subheaps to shared pool. As a result, applications see noncontiguous multiple subheaps as a heap in their address space. We target Java applications to implement our heap-sharing scheme in the KVM from Sun Microsystems. To protect fragmented heap space with a limited number of regions in memory protection unit (MPU), we maintain only a limited number of subheaps. We experimentally evaluate our heap management scheme with J2ME MIDP applications. Our static and dynamic schemes reduce heap memory usage, on average, by 30 and 27%, respectively. For both schemes, overheads are kept low. The execution times in our schemes are increased only by 0.01% for static scheme and 0.35% for dynamic scheme, on average.

show abstract

“…Our method, by contrast, does not need the knowledge of allocation site. Since the precision of a garbage collector depends on its ability to distinguish between reachable heap objects and live heap objects, even state of art garbage collectors leave a significant amount of garbage uncollected [Agesen et al 1998;Shaham et al 2000Shaham et al , 2001Shaham et al , 2002. All reported attempts to incorporate liveness in garbage collection have been quite approximate.…”

Section: Liveness Analysis Of Heap Datamentioning

confidence: 99%

Heap reference analysis using access graphs

Khedker

Sanyal

2007

ACM Trans. Program. Lang. Syst.

View full text Add to dashboard Cite

Despite significant progress in the theory and practice of program analysis, analyzing properties of heap data has not reached the same level of maturity as the analysis of static and stack data. The spatial and temporal structure of stack and static data is well understood while that of heap data seems arbitrary and is unbounded. We devise bounded representations that summarize properties of the heap data. This summarization is based on the structure of the program that manipulates the heap. The resulting summary representations are certain kinds of graphs called access graphs. The boundedness of these representations and the monotonicity of the operations to manipulate them make it possible to compute them through data flow analysis.An important application that benefits from heap reference analysis is garbage collection, where currently liveness is conservatively approximated by reachability from program variables. As a consequence, current garbage collectors leave a lot of garbage uncollected, a fact that has been confirmed by several empirical studies. We propose the first ever end-to-end static analysis to distinguish live objects from reachable objects. We use this information to make dead objects unreachable by modifying the program. This application is interesting because it requires discovering data flow information representing complex semantics. In particular, we formulate the following new analyses for heap data: liveness, availability, and anticipability and propose solution methods for them. Together, they cover various combinations of directions of analysis (i.e., forward and backward) and confluence of information (i.e. union and intersection). Our analysis can also be used for plugging memory leaks in C/C++ languages.

show abstract

On effectiveness of GC in Java

Cited by 13 publications

References 13 publications

On the type accuracy of garbage collection

On the type accuracy of garbage collection

Shared heap management for memory-limited java virtual machines

Heap reference analysis using access graphs

Contact Info

Product

Resources

About