Connectivity-based garbage collection

ACM SIGPLAN Notices

Volumn 38, Issue 11, 2003, Pages 359-373

  Hirzel, Martin ^a   Diwan, Amer ^a   Hertz, Matthew ^b  

^a UNIVERSITY OF COLORADO   (United States)

^b UNIVERSITY OF MASSACHUSETTS   (United States)

Author keywords

Connectivity based garbage collection

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STRUCTURES; JAVA PROGRAMMING LANGUAGE; PROGRAM COMPILERS; RESPONSE TIME (COMPUTER SYSTEMS); XML;

CONNECTIVITY-BASED GARBAGE COLLECTION; OBJECT-CONNECTIVITY;

STORAGE ALLOCATION (COMPUTER);

EID: 1442263992     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/949343.949337     Document Type: Conference Paper

References (48)

1. Ravindra Ahuja, Thomas Magnanti, and James Orlin. Network Flows Theory, Algorithms, and Applications. Prentice Hall, 1993.
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, 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.
3. Lars Ole Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, 1994. DIKU report 94/19.
4. Andrew Appel. Simple generational garbage collection and fast allocation. Software - Practice and Experience, 1989.
5. Matthew Arnold, Stephen Fink, David Grove, Michael Hind, and Peter Sweeney. Adaptive optimization in the Jalapeño JVM. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2000.
6. Henry G. Baker, Jr. List processing in real time on a serial computer. Communications of the ACM (CACM), 1978.
7. Dave A. Barrett, and Benjamin G. Zorn. Garbage collection using a dynamic threatening boundary. In Programming Languages Design and Implementation (PLDI), 1995.
8. Stephen M. Blackburn, Richard Jones, Kathryn S. McKinley, and J. Eliot B. Moss. Beltway: getting around garbage collection gridlock. In Programming Languages Design and Implementation (PLDI), 2002.
9. Richard Brooksby, and Nicholas Barnes. The memory pool system. Unpublished paper, 2002.
10. Brendon Cahoon. Java-Olden benchmarks. http.//www.-ali.cs.umass.edu/~cahoon/olden.
11. Dante Cannarozzi, Michael Plezbert, and Ron Cytron. Contaminated garbage collection. In Programming Languages Design and Implementation (PLDI), 2000.
12. C. J. Cheney. A non-recursive list compaction algorithm. Communications of the ACM (CACM), 1970.
13. Perry Cheng, Robert Harper, and Peter Lee. Generational stack collection and profile-driven pretenuring. In Programming Languages Design and Implementation (PLDI), 1998.
14. Trishul Chilimbi, and James Larus. Using generational garbage collection to implement cache-conscious data placement. In International Symposium on Memory Management (ISMM), 1998.
15. Edsgar W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On-the-fly garbage collection: an exercise in cooperation. Communications of the ACM (CACM), 1978.
16. Amer Diwan, Kathryn McKinley, and J. Eliot B. Moss. Using types to analyze and optimize object-oriented programs. Transactions on Programming Languages and Systems (TOPLAS), 2001.
17. Julian Dolby and Andrew Chien. An automatic object inlining optimization and its evaluation. In Programming Languages Design and Implementation (PLDI), 2000.
18. David Gay, and Alex Aiken. Memory management with explicit regions. In Programming Languages Design and Implementation (PLDI), 1998.
19. Rakesh Ghiya, and Laurie Hendren. Connection analysis: a practical interprocedural heap analysis for C. International Journal of Parallel Programming, 1996.
20. Timothy Harris. Early storage reclamation in a tracing garbage collector. ACM SIGPLAN Notices, April 1999.
21. Barry Hayes. Using key object opportunism to collect old objects. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1991.
22. Matthew Hertz, Stephen M. Blackburn, J. Eliot B. Moss, Kathryn S. McKinley, and Darko Stefanović. Error-free garbage collection traces: How to cheat and not get caught. In ACM SIGMETRICS, 2002.
23. Martin Hirzel, Harold N. Gabow, and Amer Diwan. Choosing a set of partitions to collect in a connectivity-based garbage collector. Technical Report CU-CS-958-03, University of Colorado at Boulder, 2003.
24. Martin Hirzel, Johannes Henkel, Amer Diwan, and Michael Hind. Understanding the connectivity of heap objects. In International Symposium on Memory Management (ISMM), 2002.
25. Richard Hudson and J. Eliot B. Moss. Incremental collection of mature objects. In International Workshop on Memory Management (IWMM), 1992.
26. Richard Jones and Rafael Lins. Garbage collection: Algorithms for automatic dynamic memory management. John Wiley & Son Ltd., 1996.
27. Chris Lattner and Vikram Adve. Automatic pool allocation for disjoint data structures. In Workshop on Memory System Performance (MSP), 2002.
28. Ondřej Lhoták and Laurie Hendren. Scaling Java points-to analysis using SPARK. In Compiler Construction (CC), 2003.
29. J. Eliot B. Moss. Regions determined by kind and generation. Unpublished note, 1999.
30. Young Gil Park and Benjamin Goldberg. Escape analysis on lists. In Programming Languages Design and Implementation (PLDI), 1992.
31. Feng Qian and Laurie Hendren. An adaptive region-based allocator for Java. In International Symposium on Memory Management (ISMM), 2002.
32. Atanas Rountev, Ana Milanova, and Barbara G. Ryder. Points-to analysis for Java using annotated constraints. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2001.
33. Matthew Seidl and Benjamin Zorn. Segregating heap objects by reference behavior and lifetime. In Architectural Support for Programming Languages and Operating Systems (ASPLOS), 1998.
34. Yefim Shuf, Manish Gupta, Rajesh Bordawekar, and Jaswinder Pal Singh. Exploiting prolific types for memory management and optimizations. In Principles of Programming Languages (POPL), 2002.
35. Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew Appel, and Jaswinder Pal Singh. Creating and preserving locality of Java applications at allocation and garbage collection times. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2002.
36. Standard Performance Evaluation Corporation (SPEC). SPECjvm98 benchmarks. http://www.specbench.org/osg/jvm98.
37. Bjarne Steensgaard. Points-to analysis in almost linear time. In Principles of Programming Languages (POPL), 1996.
38. Bjarne Steensgaard. Thread-specific heaps for multi-threaded programs. In International Symposium on Memory Management (ISMM), 2000.
39. Darko Stefanović, Matthew Hertz, Stephen M. Blackburn, Kathryn S. McKinley, and J. Eliot B. Moss. Older-first garbage collection in practice: Evaluation in a Java virtual machine. In Workshop on Memory System Performance (MSP), 2002.
40. Darko Stefanović, Kathryn McKinley, and J. Eliot B. Moss. Age-based garbage collection. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 1999.
41. Darko Stefanović, Kathryn S. McKinley, and J. Eliot B. Moss. On models for object lifetime distributions. In International Symposium on Memory Management (ISMM), 2000.
42. David Tarditi and Amer Diwan. Measuring the cost of storage management. Lisp and symbolic computation, 1996.
43. Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, 1997.
44. David Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. In Practical Software Development Environments, 1984.
45. John Whaley and Monica Lam. An efficient inclusion-based points-to analysis for strictly-typed languages. In Static Analysis Symposium (SAS), 2002.
46. Paul R. Wilson. Uniprocessor garbage collection techniques. Accepted for publication in ACM Computing Surveys.
47. Paul R. Wilson, Michael S. Lam, and Thomas G. Moher. Effective "static-graph" reorganization to improve locality in garbage collected systems. In Programming Languages Design and Implementation (PLDI), 1991.
48. Karen Zee and Martin Rinard. Write barrier removal by static analysis. In Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), 2002.