Controlling garbage collection and heap growth to reduce the execution time of java applications

ACM Transactions on Programming Languages and Systems

Volumn 28, Issue 5, 2006, Pages 908-941

  Brecht, Tim ^a,e   Arjomandi, Eshrat ^b   Chang, L I ^c,f   Pham, Hang ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b YORK UNIVERSITY   (Canada)

^c IBM   (United States)

^d UNIVERSITY OF TORONTO   (Canada)

^e UNIVERSITY OF WATERLOO   (Canada)

^f IBM CANADA LTD   (Canada)

Author keywords

Garbage collection; Heap growth; Implementation; Java; Memory management; Performance measurement; Programming languages

Indexed keywords

GARBAGE COLLECTION; HEAP GROWTH; IMPLEMENTATION; MEMORY MANAGEMENT; PERFORMANCE MEASUREMENT;

CONTROL SYSTEMS; DATA STORAGE EQUIPMENT; DECISION MAKING; INFORMATION MANAGEMENT; VIRTUAL REALITY;

JAVA PROGRAMMING LANGUAGE;

EID: 33748573985     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1152649.1152652     Document Type: Article

References (36)

1. ALONSO, R. AND APPEL, A. W. 1990. Advisor for flexible working sets. In Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems (Boulder CO). ACM Press, 153-162.
2. ANDREASSON, E., HOFFMANN, F., AND LINDHOLM, O. 2002. Memory management through machine learning: To collect or not to collect? In Usenix Java Virtual Machine Research and Technology Symposium (JVM) (San Fransisco, CA).
3. APPEL, A. 2003. Personal communication.
4. APPEL, A. W. 1989. Simple generational garbage collection and fast allocation. Softw. Pract. Exper. 19, 2, 171-183.
5. ATTANASIO, C. R., BACON, D. F., COCCHI, A., AND SMITH, S. 2001. A comparative evaluation of parallel garbage collectors. In Proceedings of the 14th Annual Workshop on Languages and Compilers for Parallel Computing (Cumberland Falls, KT). Lecture Notes in Computer Science Springer Verlag.
6. AZATCHI, H., LEVANONI, Y., PAZ, H., AND PETRANK, E. 2003. An on-the-fly mark-and-sweep garbage collector based on sliding view. In Proceedings of the (OOPSLA) ACM Conference on ObjectOriented Systems, Languages and Applications (Anaheim, CA). ACM SIGPLAN Notices.
7. BACON, D. F., ATTANASIO, C. R., LEE, H. B., RAJAN, V. T., AND SMITH, S. 2001. Java without the coffee breaks: A nonintrusive multiprocessor garbage collector. In Proceedings of the SIGPLAN Conference on Programming Languages Design and Implementation (Snowbird, UT). ACM SIGPLAN Notices,
8. BARABASH, K., OSSIA, Y., AND PETRANK, E. 2003. Mostly concurrent garbage collection revisited. In Proceedings of the (OOPSLA) ACM Conference on Object-Oriented Systems, Languages and Applications (Anaheim, CA.). ACM SIGPLAN Notices.
9. BOEHM, H.-J. 2000. Reducing garbage collector cache misses. In Proceedings of the 2nd International Symposium on Memory Management (Minneapolis, MN), T. Hosking, Ed. ACM SIGPLAN Notices 36, 1.
10. BOEHM, H.-J. 2004. A garbage collector for C and C++. Hans Boehm's Web page for his garbage collector, http://www.hpl.hp.com/personal/Hans_Boehm/gc/.
11. BOEHM, H.-J. AND WEISER, M. 1988. Garbage collection in an uncooperative environment. Softw. Pract. Exper. 18, 9, 807-820.
12. CHILIMBI, T. M. AND LARUS, J. R. 1998. Using generational garbage collection to implement cache-conscious data placement. In Proceedings of the 1st International Symposium on Memory Management (Vancouver, BC), R. Jones, Ed. ACM SIGPLAN Notices 34, 3, 37-48.
13. COOPER, E., NETTLES, S., AND SUBRAMANIAN, I. 1992. Improving the performance of SML garbage collection using application-specific virtual memory management. In Conference Record of the ACM Symposium on Lisp and Functional Programming (San Fransisco, CA). ACM Press, 43-52.
14. DIMPSEY, R., ARORA, R., AND KUIPER, K. 2000. Java server performance: A case study of building efficient, scalable JVMs. IBM Syst. J. 39, 1, 151-174.
15. DOMANI, T., KOLODNER, E., AND PETHANK, E. 2000. A generational on-the-fly garbage collector for Java. In Proceedings of SIGPLAN Conference on Programming Languages Design and Implementation (Vancouver, EC). ACM SIGPLAN Notices.
16. FITZGERALD, R. AND TARDITI, D. 2000. The case for profile-directed selection of garbage collectors.In Proceedings of the 2nd International Symposium on Memory Management (Minneapolis, MN) T. Hosking, Ed. ACM SIGPLAN Notices 36, 1.
17. Geodesic Systems, Inc. 2002. REMIDI, Geodesic Systems, Inc. http://www.geodesic.com/-solutions/remidi.html.
18. GRUNWALD, D., ZORN, B., AND HENDERSON, R. 1993. Improving the cache locality of memory allocation. In Proceedings of the SIGPLAN Conference on Programming Languages Design, and Implementation (Albuquerque, NM). ACM SIGPLAN Notices 28, 6, 177-186.
19. JONES, R. E. AND LINS, R. 1996. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley Somerset, NJ.
20. KIM, T., CHANG, N., AND SHIN, H. 2000. Bounding worst case garbage collection time for embedded real-time systems. In Proceedings of the 6th IEEE Real Time Technology and Applications Symposium (RTAS).
21. MOON, D. A. 1984. Garbage collection in a large LISP system. In Conference Record of the ACM Symposium on Lisp and Functional Programming (Austin, TX), G. L. Steele, Ed. ACM Press,235-245.
22. OSSIA, Y., BEN-YITZHAK, O., GOFT, I., KOLODNER, E. K., LEIKEHMAN, V., AND OWSHANKO, A. 2002. A parallel, incremental and concurrent GC for servers. In Proceedings of SIGPLAN Conference on Programming Languages Design and Implementation (Berlin, Germany). ACM SIGPLAN Notices 129-140.
23. PRINTEZIS, T. 2001. Hot-Swapping between a mark-and-sweep and a mark-and-compact garbage collector in a generational environment. In Proceedings of the Java Virtual Machine Research and Technology Symposium. USENIX.
24. SHAHAM, R., KOLODNER, E. K., AND SAGIV, M. 2000. On the effectiveness of GC in Java. In ISMM Proceedings of the 2nd International Symposium on Memory Management (Minneapolis, MN),T. Hosking, Ed. ACM SIGPLAN Notices 36, 1.
25. SHUF, Y., SERRANO, M., GUPTA, M., AND SINGH, J. P. 2001. Characterizing the memory behaviorof Java workloads: A structured view and opportunities for optimizations. In Proceedings of theBIOMETRICS Conference.
26. SUN MICROSYSTEMS. 2005. Tuning garbage collection with the 5.0 Java virtual machine.http://java.sun.eom/docs/hotspot/gc5.0/gc.tuning.5.html.
27. SMITH, P. AND MORRISETT, G. 1998. Comparing mostly-copying and mark-sweep conservative collection. In Proceedings of the 1st International Symposium on Memory Management (Vancouver,BC), R. Jones, Ed. ACM SIGPLAN Notices 34, 3, 68-78.
28. UNGAR, D. M. AND JACKSON, F. 1988. Tenuring policies for generation-based storage reclamation.ACM SIGPLAN Notices 23,11, 1-17.
29. UNGAR, D. M. AND JACKSON, F. 1992. An adaptive tenuring policy for generation scavengers. ACM Trans. Program. Lang. Syst. 14, 1, 1-27.
30. WILSON, P. R. 1994. Uniprocessor garbage collection techniques. Tech. Rep., University of Texas.
31. WILSON, P. R., JOHNSTONE, M. S., NEELY, M., AND BOLES, D. 1995. Dynamic storage allocation: A survey and critical review. In Proceedings of the International Workshop on Memory Management (Kinross, Scotland), H. Baker, Ed. Lecture Notes in Computer Science, vol. 986. Springer Verlag.
32. WILSON, P. R., LAM, M.S., AND MOHER, T. G. 1991. Effective static-graph reorganization to improve locality in garbage collected systems. ACM SIGPLAN Notices 26, 6, 177-191.
33. WILSON, P. R., LAM, M. S., AND MOHER, T. G. 1992. Caching considerations for generational garbage collection. In Conference Record of the ACM Symposium on Lisp and Functional Programming (San Fransisco, CA). ACM Press, 32-42.
34. ZORN, B. 1990. Comparing mark-and-sweep and stop-and-copy garbage collection. In Conference Record of the ACM Symposium on Lisp and Functional Programming (Nice, France). ACM Press.
35. ZORN, B. 1991. The effect of garbage collection on cache performance. Tech. Rep. CU-CS-528-91,University of Colorado at Boulder.
36. ZORN, B. 1993. The measured cost of conservative garbage collection. Softw. Pract. Exper. 23,733-756.