Understanding the connectivity of heap objects

International Symposium on Memory Management

Volumn , Issue , 2002, Pages 36-49

  Hirzel, Martin ^a   Henkel, Johannes ^a   Diwan, Amer ^a   Hind, Michael ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Connectivity based garbage collection; Object lifetimes

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS); SERVERS; VIRTUAL REALITY;

GARBAGE COLLECTORS; MEMORY MANAGEMENT;

STORAGE ALLOCATION (COMPUTER);

EID: 0242443833     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/512434.512435     Document Type: Conference Paper

References (43)

1. 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, J.R. Russell, V. Sarkar, M.J. Serrano, J.C. Shepherd, S.E. Smith, V.C. Sreedhar, H. Srinivasan, and J. Whaley. The Jalapeño virtual machine. IBM Systems Journal, 39(1), 2000.
2. 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 Jalapeño in Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1999.
3. H.G. Baker, Jr. The Treadmill: Real-time garbage collection without motion sickness. In OOPSLA '91 Workshop on Garbage Collection in Object-Oriented Systems, 1991. Also appeared in SIGPLAN Notices, March 1992.
4. S. Blackburn, S. Singhai, M. Hertz, K.S. McKinley, and J.E.B. Moss, Pretenuring for Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2001.
5. H. Boehm, A. Demers, and M. Weiser. A garbage collector for C and C++. http://www.hpl.hp.com/personal/Hans_Boehm/gc/.
6. M. Burke, J.-D. Choi, S. Fink, D. Grove, M. Hind, V. Sarkar, M. Serrano, V. C. Sreedhar, and H. Srinivasan. The Jalapeño dynamic optimizing compiler for Java. In ACM Java Grande Conference, San Francisco, CA, June 1999.
7. B. Cahoon, Java-Olden benchmarks. http://www-ali.cs.umass.edu/~cahoon/olden.
8. D. Cannorozzi, M. Plezbert, and R. Cytron. Contaminated garbage collection. In Programming Languages Design and Implementation (PLDI), 2000.
9. C.J. Cheney, A non-recursive list compaction algorithm. Communications of the ACM (CACM), November 1970.
10. P. Cheng, R. Harper, and P. Lee. Generational stack collection and profile-driven pretenuring. In Programming Languages Design and Implementation (PLDI), 1998.
11. T. Chilimbi and J. Larus. Using generational garbage collection to implement cache-conscious data placement. In International Symposium on Memory Management (ISMM), 1998.
12. J.-D. Choi, M. Gupta, M. Serrano, V.C. Sreedhar, and S. Midkiff. Escape analysis for Java. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1999.
13. T. Cormen, C. Leiserson, and R. Rivest. Introduction to Algorithms. MIT press, 1990.
14. S. Dieckmann and U. Hölzle. A study of allocation behavior of the SPECjvm98 Java benchmarks. In European Conference for Object-Oriented Programming (ECOOP), 1999.
15. J. Dolby and A. Chien. An automatic object inlining optimization and its evaluation. In Programming Languages Design and Implementation (PLDI), 2000.
16. R. Fitzgerald and D. Tarditi. The case for profile-directed selection of garbage collectors. In International Symposium on Memory Management (ISMM), 2000.
17. D. Gay and A. Aiken. Memory management with explicit regions. In Programming Languages Design and Implementation (PLDI), 1998.
18. D. Gay and B. Steensgaard. Fast escape analysis and stack allocation for object-based programs. In Compiler Construction (CC), 2000.
19. T. Harris. Early storage reclamation in a tracing garbage collector. ACM SIGPLAN Notices, April 1999.
20. T. Harris. Dynamic adaptive pre-tenuring. In International Symposium on Memory Management (ISMM), 2000.
21. B. Hayes. Using key object opportunism to collect old objects. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1991.
22. 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 ACM SIGMETRICS, 2002.
23. M. Hirzel, A. Diwan, and A. Hosking. On the usefulness of liveness for garbage collection and leak detection. In European Conference for Object-Oriented Programming (ECOOP), 2001.
24. R. Hudson and E. Moss. Incremental collection of mature objects. In International Workshop on Memory Management, St. Malo, France, September 1992.
25. R. Jones and R. Lins. Garbage collection: Algorithms for automatic dynamic memory management. John Wiley & Son Ltd., 1996.
26. H. Lebermann and C. Hewitt. A real-time garbage collector based on the lifetime of objects. Communications of the ACM (CACM), 1983.
27. D. Moon. Garbage collection in a large Lisp system. In Lisp and functional programming, 1984.
28. E. Ruf. Effective synchronization removal for Java. In Programming Languages Design and Implementation (PLDI), 2000.
29. M. Seidl and B. Zorn. Segregating heap objects by reference behavior and lifetime. In Architectural Support for Programming Languages and Operating Systems (ASPLOS), 1998.
30. Y. Shuf, M. Gupta, R. Bordawekar, and J. P. Singh. Exploiting prolific types for memory management and optimizations. In Principles of Programming Languages (POPL), 2002.
31. Y. Shuf, M. J. Serrano, M. Gupta, and J. P. Singh. Characterizing the memory behavior of Java workloads: A structured view and opportunities for optimizations. In SIGMETRICS, 2001.
32. Standard Performance Evaluation Corporation (SPEC). SPECjvm98 benchmarks. http://www.specbench.org/osg/jvm98.
33. B. Steensgaard. Thread-specific heaps for multi-threaded programs. In International Symposium on Memory Management (ISMM), 2000.
34. D. Stefanović, K. McKinley, and E. Moss. Age-based garbage collection. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1999.
35. D. Stefanović and E. Moss. Characterization of object behaviour in Standard ML of New Jersey. In Lisp and functional programming, 1994.
36. A. Sǎlcianu and M. Rinard. Pointer and escape analysis for multithreaded programs. In Principles and Practice of Parallel Programming (PPOPP), 2001.
37. D. Tarditi and A. Diwan. Measuring the cost of storage management. Lisp and symbolic computation, 1996.
38. M. Tofte. A brief introduction to regions. In International Symposium on Memory Management (ISMM), 1998.
39. D. Ungar, Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Practical Software Development Environments, 1984.
40. D. Ungar and F. Jackson. An adaptive tenuring policy for generation scavengers. Transactions on Programming Languages and Systems (TOPLAS), 1992.
41. F. Vivien and M. Rinard. Incrementalized pointer and escape analysis. In Programming Languages Design and Implementation (PLDI), 2001.
42. P. Wilson. Uniprocessor garbage collection techniques. Accepted for publication in ACM Computing Surveys.
43. P. R. Wilson, M. S. Lam, and T. G. Moher. Effective "static-graph" reorganization to improve locality in garbage collected systems. In Programming Languages Design and Implementation (PLDI), pages 177-191, Toronton, Canada, 1991.