(Enter summary)
Abstract: iii
Abstract
Hirzel, Martin (Ph.D., Computer Science)
"Connectivity-Based Garbage Collection"
Thesis directed by Amer Diwan
Garbage collection is an important feature of modern programming languages: by
liberating the programmer from the responsibility of freeing up unused memory by
hand, it leads to code with fewer bugs and a cleaner design. However, these software
engineering benefits have their costs: garbage collection may incur disruptive pauses,
slowdowns, and increased memory... (Update)
Similar documents based on text: More All
0.4: Converting Java Classes to Use Generics - von Dincklage, Diwan (2004)
(Correct)
0.4: A Tool for Writing and Debugging Algebraic Specifications - Henkel, Diwan (2004)
(Correct)
0.3: Connectivity-Based Garbage Collection - Hirzel, Diwan, Hertz (2003)
(Correct)
Related documents from co-citation: More All
4: Simple generational garbage collection and fast allocation
- Appel - 1989
4: Garbage Collection Algorithms for Automatic Dynamic Memory Management (context) - Jones, Lins - 1996
3: Adaptive optimization in the Jalapeno JVM
- Arnold, Fink et al. - 2000
BibTeX entry: (Update)
M. Hirzel, A. Diwan, and M. Hertz, "Connectivity-based garbage collection," in ACM Conference on Object-Oriented Programming Systems, Languages, and Applications, Oct. 2003, pp. 359--373. http://citeseer.ist.psu.edu/article/hirzel04connectivitybased.html More
@misc{ hirzel03connectivitybased,
author = "M. Hirzel and A. Diwan and M. Hertz",
title = "Connectivity-based garbage collection",
text = "M. Hirzel, A. Diwan, and M. Hertz, Connectivity-based garbage collection,
in ACM Conference on Object-Oriented Programming Systems, Languages, and
Applications, Oct. 2003, pp. 359--373.",
year = "2003",
url = "citeseer.ist.psu.edu/article/hirzel04connectivitybased.html" }
Citations (may not include all citations):
3972
Introduction to Algorithms (context) - Cormen, Leiserson et al. - 1990
1399
Compilers: Principles (context) - Aho, Sethi et al. - 1985
380
The Java Language Specification (context) - Gosling, Joy et al. - 2000
370
Network Flows: Theory (context) - Ahuja, Magnanti et al. - 1993
262
Uniprocessor garbage collection techniques
- Wilson
190
Optimization of objectoriented programs using static class h..
- ey, David et al. - 1995
188
Region-based memory management
- Tofte, Talpin - 1997
173
A real-time garbage collector based on the lifetimes of obje..
- Lieberman, Hewitt - 1983
167
Garbage collection in an uncooperative environment (context) - Boehm, Weiser - 1988
162
A new approach to the maximumflow problem (context) - Goldberg, Tarjan - 1988
154
Escape analysis for Java
- Choi, Gupta et al. - 1999
150
Parametric shape analysis via 3-valued logic
- Sagiv, Reps et al. - 1999
146
Parallelizing Programs with Recursive Data Structures (context) - Hendren - 1990
144
Garbage Collection: Algorithms for Automatic Dynamic Memory .. (context) - Jones, Lins - 1996
129
fly garbage collection: an exercise in cooperation (context) - Dijkstra, Lamport et al. - 1978
123
Simple generational garbage collection and fast allocation
- Appel - 1989
112
Dynamic storage allocation: a survey and critical review
- Wilson, Johnstone et al. - 1995
87
Adaptive optimization in the Jalapeno JVM
- Arnold, Fink et al. - 2000
86
The Jalapeno virtual machine (context) - Alpern, Attanasio et al. - 2000
80
Optimizing dynamically-dispatched calls with run-time type f.. (context) - Holzle, Ungar - 1994
75
Practical virtual method call resolution for Java
- Sundaresan, Hendren et al. - 2000
71
Fast static analysis of C++ virtual function calls (context) - Bacon, Sweeney - 1996
70
Points-to analysis in almost linear time
- Steensgaard - 1996
69
Unification-based pointer analysis with directional assignme..
- Das - 2000
65
The Java Virtual Machine Specification (context) - Lindholm, Yellin - 1999
64
A method for overlapping and erasure of lists (context) - Collins - 1960
62
Scalable propagation-based call graph construction algorithm..
- Tip, Palsberg - 2000
62
Program Analysis and Specialization for the C Programming La.. (context) - Andersen - 1994
58
Memory management with explicit regions
- Gay, Aiken - 1998
54
Practicing JUDO: Java under dynamic optimizations (context) - Cierniak, Lueh et al. - 2000
54
Programming with regions in the ML Kit
- Tofte, Birkedal et al. - 2001
51
Connection analysis: a practical interprocedural heap analys..
- Ghiya, Hendren - 1996
47
Using generational garbage collection to implement cache-con.. (context) - Chilimbi, Larus - 1998
45
Inlining of virtual methods
- Detlefs, Agesen - 1999
45
ective synchronization removal for Java (context) - Ruf - 2000
43
Ultra-fast aliasing analysis using CLA: a million lines of C..
- Heintze, Tardieu - 2001
42
Fiat: A framework for interprocedural analysis and transform.. (context) - Hall, Mellor-Crummey et al. - 1993
39
Modular interprocedural pointer analysis using access paths:..
- Cheng, Hwu - 2000
37
Using key object opportunism to collect old objects (context) - Hayes - 1991
34
Relevant context inference (context) - Chatterjee, Ryder et al. - 1999
33
Extending and evaluating flow-insensitive and context-insens..
- Liang, Pennings et al. - 2001
33
Garbage collection and local variable type-precision and liv..
- Agesen, Detlefs et al. - 1998
33
The Treadmill: Real-time garbage collection without motion s..
- Baker - 1991
32
Points-to analysis for Java using annotated constraints
- Rountev, Milanova et al. - 2001
31
A study of allocation behavior of the SPECjvm98 Java benchma..
- Dieckmann, Holzle - 1999
30
Segregating heap objects by reference behavior and lifetime
- Seidl, Zorn - 1998
30
A framework for reducing the cost of instrumented code
- Arnold, Ryder - 2001
30
Generational stack collection and profile-driven pretenuring
- Cheng, Harper et al. - 1998
29
Pointer analysis: haven't we solved this problem yet
- Hind - 2001
27
real-time garbage collector (context) - Cheng, Blelloch et al. - 2001
27
Scaling Java points-to analysis using SPARK (context) - Lhotak, Hendren - 2003
26
Pointer and escape analysis for multithreaded programs
- Salcianu, Rinard - 2001
25
Interprocedural optimization: Eliminating unnecessary recomp.. (context) - Burke, Torczon - 1993
24
Which pointer analysis should I use
- Hind, Pioli - 2000
23
Beltway: getting around garbage collection gridlock
- Blackburn, Jones et al. - 2002
22
Characterizing the memory behavior of Java workloads: a stru..
- Shuf, Serrano et al. - 2001
22
staticgraph (context) - Wilson, Lam et al. - 1991
22
Generational garbage collection and the radioactive decay mo..
- Clinger, Hansen - 1997
22
ects of the precision of pointer analysis (context) - Shapiro, Horwitz - 1997
20
Incremental collection of mature objects
- Hudson, Eliot et al. - 1992
20
Java Native Interface specification (context) - Microsystems - 1997
17
Interprocedural optimization: eliminating unnecessary recomp.. (context) - Cooper, Kennedy et al. - 1986
16
An automatic object inlining optimization and its evaluation
- Dolby, Chien - 2000
16
Fast escape analysis and stack allocation for object-based p..
- Gay, Steensgaard - 2000
16
Garbage collection using a dynamic threatening boundary
- Barrett, Zorn - 1995
16
Pretenuring for Java
- Blackburn, Singhai et al. - 2001
15
High performance garbage collection in Java with MMTk (context) - Blackburn, Cheng et al. - 2004
15
Flow-insensitive points-to analysis with term and set constr..
- rey, Foster et al. - 1997
15
ective link-time optimization of Modula-3 programs (context) - Fernandez - 1995
14
line variable substitution for scaling points-to analysis (context) - Rountev, Chandra - 2000
13
Partial online cycle elimination in inclusion constraint gra..
- Fahndrich, rey et al. - 1998
12
The case for profile-directed selection of garbage collector..
- Fitzgerald, Tarditi - 2000
12
Concurrent cycle collection in reference counted systems
- Bacon, Rajan - 2001
12
Incrementalized pointer and escape analysis
- Vivien, Rinard - 2001
12
Automatic pool allocation for disjoint data structures
- Lattner, Adve - 2002
12
The Java HotSpot server compiler (context) - Paleczny, Vick et al. - 2001
12
Debugging optimized code with dynamic deoptimization
- Holzle, Chambers et al. - 1992
11
Bursty tracing: a framework for lowoverhead temporal profili..
- Hirzel, Chilimbi - 2001
11
A comparative evaluation of parallel garbage collector imple..
- Attanasio, Bacon et al. - 2001
11
Demand-driven pointer analysis
- Heintze, Tardieu - 2001
10
Age-based garbage collection
- Stefanovic, McKinley et al. - 1999
10
cient inclusion-based points-to analysis for strictly-typed .. (context) - Whaley, Lam - 2002
9
Dynamic adaptive pre-tenuring
- Harris - 2000
9
Using types to analyze and optimize object-oriented programs
- Diwan, McKinley et al. - 2001
8
Characterization of object behaviour in Standard ML of New J.. (context) - Stefanovic, Eliot et al. - 1994
7
Error-free garbage collection traces: how to cheat and not g..
- Hertz, Blackburn et al. - 2002
7
Using tracing and dynamic slicing to tune compilers
- Larus, Chandra - 1993
7
Thread-specific heaps for multi-threaded programs
- Steensgaard - 2000
7
Escape analysis on lists
- Park, Goldberg - 1992
7
A brief introduction to regions (context) - Tofte - 1998
6
Evaluating the precision of static reference analysis using .. (context) - Liang, Pennings et al. - 2002
6
Myths and realities: The performance impact of garbage colle..
- Blackburn, Cheng et al. - 2004
6
Benchmark Health considered harmful
- Zilles - 2001
6
the usefulness of liveness for garbage collection and leak d..
- Hirzel, Diwan et al. - 2001
6
Measuring the cost of storage management
- Tarditi, Diwan - 1996
6
Older-first garbage collection in practice: evaluation in a ..
- Stefanovic, Hertz et al. - 2002
5
Exploiting prolific types for memory management and optimiza..
- Shuf, Gupta et al. - 2002
5
Creating and preserving locality of Java applications at all.. (context) - Shuf, Gupta et al. - 2002
5
Evaluating a demand driven technique for call graph construc..
- Agrawal, Li et al. - 2002
5
Precise analysis of string expressions (context) - Christensen, Mller et al. - 2003
5
Pointer analysis in the presence of dynamic class loading (context) - Hirzel, Diwan et al. - 2004
5
A non-recursive list compaction algorithm (context) - Cheney - 1970
5
Space- and time-e#cient implementation of the Java object mo.. (context) - Bacon, Fink et al. - 2002
5
Analysis of large code bases: the compile-link-analyze model
- Heintze - 1999
4
Connectivity-based garbage collection
- Hirzel, Diwan et al. - 2003
4
On models for object lifetime distributions (context) - Stefanovic, McKinley et al. - 2000
4
Thin guards: A simple and e#ective technique for reducing th.. (context) - Arnold, Ryder - 2002
4
Early storage reclamation in a tracing garbage collector
- Harris - 1999
4
Data structure analysis: an e#cient contextsensitive heap an.. (context) - Lattner, Adve - 2003
3
region-based allocator for Java (context) - Qian, Hendren - 2002
3
Understanding the connectivity of heap objects
- Hirzel, Henkel et al. - 2002
3
the type accuracy of garbage collection
- Hirzel, Diwan - 2000
3
Can a shape analysis work at run-time (context) - Bogda, Singh - 2001
3
Write barrier removal by static analysis
- Zee, Rinard - 2002
3
Dynamic optimistic interprocedural analysis: a framework and..
- Pechtchanski, Sarkar - 2001
2
A dynamic optimization framework for a Java justin -time com.. (context) - Suganuma, Yasue et al. - 2001
2
A framework for interprocedural analysis and optimization in.. (context) - Sreedhar, Burke et al. - 2000
2
the usefulness of type and liveness accuracy for garbage col..
- Hirzel, Diwan et al. - 2002
2
The memory pool system (context) - Brooksby, Barnes - 2002
2
Finding your cronies: static analysis for dynamic object col..
- Guyer, McKinley - 2004
2
ective Interprocedural Optimization of Object-Oriented Langu.. (context) - Grove - 1998
2
Towards dynamic interprocedural analysis in JVMs (context) - Qian, Hendren - 2004
1
ACM Student Research Competition (context) - King, synchronization et al. - 2003
1
and evaluation of adaptive recompilation with on-stack repla.. (context) - Fink, Qian et al. - 2003
1
Mostly parallel garbage (context) - Boehm, Demers et al. - 1991
1
Choosing a set of partitions to collect in a connectivity-ba.. (context) - Hirzel, Gabow et al. - 2003
1
Recycling garbage theory
- Grotho - 2004
1
and Ron Cytron (context) - Cannarozzi, Plezbert - 2000
1
Mostly concurrent garbage collection revisited
- Barabash, Ossia et al. - 2003
1
Optimizing Java bytecode using the Soot framework: is it fea.. (context) - Vallee-Rai, Gagnon et al. - 2000
1
Regions determined by kind and generation (context) - Eliot, Moss - 1999
http://www.eclipse.org
http://www.hpl.hp.com/personal/Hans_Boehm/gc/
http://www.ibm.com/developerworks/oss/jikesrvm
http://jakarta.apache.org/
http://www.gnu.org/
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC