Quantifying the performance of garbage collection vs. explicit memory management

Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications, OOPSLA

Volumn , Issue , 2005, Pages 313-326

  Hertz, Matthew ^a   Berger, Emery D ^b  

^a CANISIUS COLLEGE   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

Explicit memory management; Garbage collection; Oracular memory management; Paging; Performance analysis; Throughput; Time space tradeoff

Indexed keywords

GARBAGE COLLECTION; ORACULAR MEMORY MANAGEMENT; PAGING; PERFORMANCE ANALYSIS; TIME-SPACE TRADEOFF;

COMPUTER ARCHITECTURE; COMPUTER PROGRAMMING; STORAGE ALLOCATION (COMPUTER); THROUGHPUT;

SOFTWARE ENGINEERING;

EID: 31744449798     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (63)

1. Hardware - G5 Performance Programming, Dec. 2003. Available at http://developer.apple.com/hardware/ve/g5.html.
2. B. Alpern, C. R. Attanasio, J. J. Barton, M. G. Burke, P. Cheng, J.-D. Choi, A. Cocchi, S. J. Fink, D. Grove, M. Hind, S. F. Hummel, D. Lieber, V. Litvinov, M. F. Mergen, T. Ngo, V. Sarkar, M. J. Serrano, J. C. Shepherd, S. E. Smith, V. C. Sreedhar, H. Srinivasan, and J. Whaley. The Jalepeno virtual machine. IBM Systems Journal, 39(1), Feb. 2000.
3. B. Alpern, C. R. Attanasio, J. J. Barton, A. Cocchi, S. F. Hummel, D. Lieber, T. Ngo, M. Mergen, J. C. Shepherd, and S. Smith. Implementing Jalepeño in Java. In Proceedings of SIGPLAN 1999 Conference on Object-Oriented Programming, Languages, & Applications, volume 34(10) of ACM SIGPLAN Notices, pages 314-324, Denver, CO, Oct. 1999. ACM Press.
4. A. W. Appel. Garbage collection can be faster than stack allocation. Information Processing Letters, 25(4):275-279, 1987.
5. A. W. Appel. Allocation without locking. Software Practice and Experience, 19(7), 1989. Short Communication.
6. E. D. Beger. The hoard memory allocator. Available at http://www.hoard.org.
7. E. D. Berger, B. G. Zorn, and K. S. McKinley. Composing high-performance memory allocators. In Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), Snowbird, Utah, June 2001.
8. E. D. Berger, B. G. Zorn, and K. S. McKinley. Reconsidering custom memory allocation. In OOPSLA'02 ACM Conference on Object-Oriented Systems, Languages and Applications, ACM SIGPLAN Notices, Seattle, WA, Nov. 2002. ACM Press.
9. E. D. Berger, B. G. Zorn, and K. S. McKinley. Reconsidering custom memory allocation. In Proceedings of the Conference on Object-Oriented Programming: Systems, Languages, and Applications (OOPSLA) 2002, Seattle, Washington, Nov. 2002.
10. S. M. Blackburn, P. Cheng, and K. S. McKinley. Myths and reality: The performance impact of garbage collection. In SIGMETRICS - Performance 2004, Joint International Conference on Measurement and Modeling of Computer Systems, June 2004.
11. S. M. Blackburn, P. Cheng, and K. S. McKinley. Oil and Water? High Performance Garbage Collection in Java with MMTk. In ICSE 2004, 26th International Conference on Software Engineering, page to appear, May 2004.
12. S. M. Blackburn and K. S. McKinley. Ulterior reference counting: Fast garbage collection without a long wait. In OOPSLA 2003 ACM Conference on Object-Oriented Programming, Systems, Languages and Applications, Oct. 2003.
13. H.-J. Boehm, Reducing garbage collector cache misses. In T. Hosking, editor, ISMM 2000 Proceedings of the Second International Symposium on Memory Management, volume 36(1) of ACM SIGPLAN Notices, Minneapolis, MN, Oct. 2000. ACM Press.
14. H.-J. Boehm and M. Weiser. Garbage collection in an uncooperative environment. Software: Practice and Experience, 18(9):807-820,Sept. 1988.
15. D. Burger, T. M. Austin, and S. Bennett. Evaluating future microprocessors: The SimpleScalar tool set. Computer Sciences Technical Report CS-TR-1996-1308, University of Wisconsin-Madison, Madison, WI, 1996.
16. G. Colvin, B. Dawes, and D. Adler. C++ Boost Smart Pointers, Oct. 2004. Available at http://www.boost.org/libs/smart.ptr/smart.ptr.htm.
17. S. P. E. Corporation. Specjbb2000. Available at http://www.spec.org/ jbb2000/docs/userguide.html.
18. S. P. E. Corporation. Specjvm98 documentation, Mar. 1999.
19. D. L. Detlefs. Concurrent garbage collection for C++. In P. Lee, editor, Topics in Advanced Language Implementation. MIT Press, 1991.
20. A. Diwan, D. Tarditi, and E. Moss. Memory system performance of programs with intensive heap allocation. ACM Trans. Comput. Syst., 13(3):244-273, Aug. 1995.
21. J. Dolby. Automatic inline allocation of objects. In Proceedings of SIGPLAN'97 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, Las Vegas, Nevada, June 1997. ACM Press.
22. J. Dolby and Chien. An evaluation of object inline allocation techniques. In OOPSLA'98 ACM Conference on Object-Oriented Systems, Languages and Applications, ACM SIGPLAN Notices, Vancouver, Oct. 1998. ACM Press.
23. J. Dolby and Chien. An automatic object inlining and its evaluation. In Proceedings of SIGPLAN 2000 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, pages 345-357, Vancouver, June 2000. ACM Press.
24. Y. Feng and E. D. Berger. A locality-improving dynamic memory allocator. In Proceedings of the ACM SIGPLAN 2005 Workshop on Memory System Performance (MSP), Chicago, Illinois, June 2005.
25. R. R. Fenichel and J. C. Yochelson. A LISP garbage-collector for virtual-memory computer systems. Commun. ACM, 12(11):611-612, Nov. 1969.
26. D. Gay and A. Aiken. Memory management with explicit regions. In Proceedings of the 1998 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 313 - 323, Montreal, Canada, June 1998.
27. D. Gay and A. Aiken. Language support for regions. In Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 70 - 80, Snowbird, Utah, June 2001.
28. W. Gloger. Dynamic memory allocator implementations in linux system libraries. Available at http://www.dent.med.uni-muenchen.de/~wmglo/malloc- slides.html.
29. D. Grossman, G. Morrisett, T. Jim, M. Hicks, Y. Wang, and J. Cheney. Region-based memory management in cyclone. In Proceedings of the 2002 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 282-293, Berlin, Germany, June 2002.
30. J. Guy L Steele. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495-508, 1975.
31. D. R. Hanson. Fast allocation and deallocation of memory based on object lifetimes. In Software Practice & Experience, volume 20(1), pages 5-12. Wiley, Jan. 1990.
32. M. Hertz and E. D. Berger. Garbage collection without paging. In Proceedings of the 2005 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), pages 143-153, June 2005.
33. M. Hertz, S. M. Blackburn, J. E. B. Moss, K. S. McKinley, and D. Stefanović. Error-free garbage collection traces: How to cheat and not get caught. In Proceedings of the International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS 2002), pages 140-151, Marina Del Ray, CA, June 2002.
34. M. Hertz, N. Immerman, and J. E. B. Moss. Framework for analyzing garbage collection. In Foundations of Information Technology in the Era of Network and Mobile Computing: IFIP 17th World Computer Congress - TC1 Stream (TCS 2002), pages 230-241, Montreal, Canada, Aug. 2002. Kluwer.
35. M. Hicks, G. Morrisett, D. Grossman, and T. Jim. Experience with safe manual memory-management in Cyclone. In A. Diwan, editor, ISMM'04 Proceedings of the Third International Symposium on Memory Management, ACM SIGPLAN Notices, Vancouver, Oct. 2004. ACM Press.
36. M. W. Hicks, J. T. Moore, and S. M. Nettles. The measured cost of copying garbage collection mechanisms. In Proceedings of the ACM SIGPLAN Conference on Functional Programming, pages 292-305. ACM, June 1997.
37. M. Hirzel, A. Diwan, and T. Hosking. On the usefulness of liveness for garbage collection and leak detection. In J. L. Knudsen, editor, Proceedings of 15th European Conference on Object-Oriented Programming, ECOOP 2001, volume 2072 of Springer-Verlag, Budapest, June 2001. Springer-Verlag.
38. X. Huang, S. M. Blackburn, K. S. McKinley, J. E. B. Moss, Z. Wang, and P. Cheng. The garbage collection advantage: Improving program locality. In Proceeding of the ACM Conference on Object-Oriented Systems, Languages and Applications, Vancouver, BC, Canada, Oct. 2004.
39. X. Huang, J. E. B. Moss, K. S. Mckinley, S. Blackburn, and D. Burger. Dynamic SimpleScalar: Simulating Java virtual machines. Technical Report TR-03-03, University of Texas at Austin, Feb. 2003.
40. M. S. Johnstone and P. R. Wilson. The memory fragmentation problem: Solved? In International Symposium on Memory Management, Vancouver, B.C., Canada, 1998.
41. R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996.
42. P.-H. Kamp. Malloc(3) revisited. http://phk.freebsd.dk/pubs/malloc.pdf.
43. D. G. Korn and K.-P. Vo. In search of a better malloc. In USENIX Conference Proceedings, Summer 1985, pages 489-506, Portland, OR, 1985.
44. D. Lea. A memory allocator, 1998. Available at http://g.oswego.edu/dl/ html/malloc.html.
45. J. McCarthy. Recursive functions of symbolic expressions and their computation by machine. Communications of the ACM, 3:184-195, 1960.
46. M. Michael. Scalable lock-free dynamic memory allocation. In Proceedings of SIGPLAN 2004 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, Washington, DC, June 2004. ACM Press.
47. J. S. Miller and G. J. Rozas. Garbage collection is fast, but a stack is faster. Technical Report AIM-1462, MIT AI Laboratory, Mar. 1994.
48. G. Phipps. Comparing observed bug and productivity rates for Java and C++. Software Practice & Experience, 29(4):345-358, 1999.
49. 2: High-performance garbage collection for memory-constrained environments. In Proceedings of the ACM Conference on Object-Oriented Systems, Languages and Applications, Vancouver, BC, Canada, Oct. 2004.
50. P. Savola. Lbnl traceroute heap corruption vulnerability. Available at http://www.securityfocus.com/bid/1739.
51. R. Shaham, E. Kolodner, and M. Sagiv. Estimating the impact of liveness information on space consumption in Java. In D. Detlefs, editor, ISMM'02 Proceedings of the Third International Symposium on Memory Management, ACM SIGPLAN Notices, pages 64-75, Berlin, June 2002. ACM Press.
52. Y. Smaragdakis, S. F. Kaplan, and P. R. Wilson. The EELRU adaptive replacement algorithm. Performance Evaluation, 53(2):93-123, July 2003.
53. D. Sugalski. Squawks of the parrot: What the heck is: Garbage collection, June 2003. Available at http://www.sidhe.org/~dan/blog/archives/000200.html.
54. M. Tofte and J.-P. Talpin. Region-based memory management. Information and Computation, 132(2):109-176, 1997.
55. L. Torvalds. Re: Faster compilation speed, 2002. Available at http://gcc.gnu.org/ml/gcc/2002-08/msg00544.html.
56. D. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Proceedings of the ACM SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pages 157-167, Pittsburgh, Pennsylvania, Apr. 1984.
57. ACM SIGPLAN Notices 19, 5 (May 1984).
58. B. Venners. Inside the Java Virtual Machine. McGraw-Hill Osborne Media, Jan. 2000.
59. Wikipedia. Comparison of Java to C++, 2004. Available at http://en.wikipedia.org/wiki/Comparison.of-Java.to-Cplusplus.
60. P. R. Wilson. Uniprocessor garbage collection techniques. In Y. Bekkers and J. Cohen, editors, Proceedings of International Workshop on Memory Management, volume 637 of Lecture Notes in Computer Science, St Malo, France, 16-18 Sept. 1992. Springer-Verlag.
61. P. R. Wilson, M. S. Lam, and T. G. Moher. Caching considerations for generational garbage collection. In Conference Record of the 1992 ACM Symposium on Lisp and Functional Programming, pages 32-42, San Francisco, CA, June 1992. ACM Press.
62. T. Yang, M. Hertz, E. D. Berger, S. F. Kaplan, and J. E. B. Moss. Automatic heap sizing: Taking real memory into account. In Proceedings of the 2004 ACM SIGPLAN International Symposium on Memory Management, Nov. 2004.
63. B. G. Zorn. The measured cost of conservative garbage collection. Software Practice and Experience, 23(7):733-756, 1993.