Skip to main content

Garbage collection for large memory Java applications

  • Workshop: Java in HPC
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1593))

Abstract

The possible applications of Java range from small applets to large, data-intensive scientific applications allocating memory in the multi-gigabyte range. As a consequence copying garbage collectors can not fulfill the requirements, as large objects can not be copied efficiently. We analyze the allocation patterns and object lifespans for different Java applications and present garbage collection techniques for these. Various heuristics to reduce fragmentation are compared. We propose just-in-time generated customized marker functions as a promising optimization during the mark-phase.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • [ADM98] Ole Agesen, David Detlefs, and J. Eliot B. Moss. Garbage collection and local variable type-precision and liveness in Java virtual machines. In Conference on Programming Language Design and Implementation, volume 33(6) of SIGPLAN, pages 269–279, Montreal, 1998. ACM.

    Google Scholar 

  • [BW88] Hans-Juergen Boehm and Mark Weiser. Garbage collection in an uncooperative environment. Software Practice and Experience, 18(9):807–820, 1988.

    Article  Google Scholar 

  • [CCZ98] Dominique Colnet, Philippe Coucaud, and Olivier Zendra. Compiler support to customize the mark and sweep algorithm. In 1998 International Symposium on Memory Management, pages 154–165, Vancouver, 1998. ACM.

    Chapter  Google Scholar 

  • [HHMN98] Michael Hicks, Luke Hornof, Jonathan T. Moore, and Scott Nettles. A study of large object spaces. In 1998 International Symposium on Memory Management, pages 138–145, Vancouver, 1998. ACM.

    Chapter  Google Scholar 

  • [HM92] Richard L. Hudson and J. Eliot B. Moss. Incremental collection of mature objects. In Proceedings of the International Workshop on Memory Management, pages 388–403, September 1992.

    Google Scholar 

  • [JL96] Richard Jones and Rafael Lins. Garbage Collection. John Wiley, 1996.

    Google Scholar 

  • [JW98] Mark S. Johnstone and Paul R. Wilson. The memory fragmentation problem: Solved? In 1998 International Symposium on Memory Management, Vancouver, 1998. ACM.

    Google Scholar 

  • [KG97] Andreas Krall and Reinhard Grafl. CACAO—a 64 bit JavaVM just-in-time compiler. Concurrency: Practice and Experience, 9(11):1017–1030, 1997.

    Article  Google Scholar 

  • [Kra98] Andreas Krall. Efficient Java VM just-in-time compilation. In Jean-Luc Gaudiot, editor, International Conference on Parallel Architectures and Compilation Techniques, pages 205–212, Paris, October 1998. IFIP,ACM,IEEE, North-Holland.

    Google Scholar 

  • [Wil94] Paul R. Wilson. Uniprocessor garbage collection techniques. In ACM Computing Surveys, page to apear. ACM, 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Peter Sloot Marian Bubak Alfons Hoekstra Bob Hertzberger

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag

About this paper

Cite this paper

Krall, A., Tomsich, P. (1999). Garbage collection for large memory Java applications. In: Sloot, P., Bubak, M., Hoekstra, A., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1999. Lecture Notes in Computer Science, vol 1593. Springer, Berlin, Heidelberg . https://doi.org/10.1007/BFb0100649

Download citation

  • DOI: https://doi.org/10.1007/BFb0100649

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65821-4

  • Online ISBN: 978-3-540-48933-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics