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

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

Volumn 36, Issue , 2001, Pages 353-366

  Brecht, Tim ^a   Arjomandi, Eshrat ^a   Li, Chang ^a   Pham, Hang ^a  

^a IBM TORONTO LAB   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; JAVA PROGRAMMING LANGUAGE; STORAGE ALLOCATION (COMPUTER); SYSTEMS ANALYSIS;

EXECUTION TIMES; GARBAGE COLLECTION; HEAP GROWTH;

COMPUTER AIDED SOFTWARE ENGINEERING;

EID: 0035551908     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/504311.504308     Document Type: Conference Paper

References (20)

1. Advisor for flexible working sets
2. Simple generational garbage collection and fast allocation
3. A garbage collector for C and C++. Hans Boehm's Web page for his garbage collector
4. Space efficient conservative garbage collection
5. Reducing garbage collector cache misses
6. Mostly parallel garbage collection
7. Garbage collection in an uncooperative environment
8. Improving the performance of SML garbage collection using application-specific virtual memory management
9. The case for profile-directed selection of garbage collectors
10. REMIDI
11. Memory system behavior of Java programs: Methodology and analysis
12. Garbage collection in a large LISP system
13. Hot-swapping between a mark&sweep and a mark&compact garbage collector in a generational environment
14. On the effectiveness of GC in Java
15. Comparing mostly-copying and mark-sweep conservative collection
16. Uniprocessor garbage collection techniques
17. Dynamic storage allocation: A survey and critical review
18. Comparing mark-and-sweep and stop-and-copy garbage collection
19. The measured cost of conservative garbage collection