ACM Home Page
Please provide us with feedback. Feedback
Dynamic selection of application-specific garbage collectors
Full text PdfPdf (186 KB)
Source International Symposium on Memory Management archive
Proceedings of the 4th international symposium on Memory management table of contents
Vancouver, BC, Canada
SESSION: New garbage collection algorithms and strategies table of contents
Pages: 49 - 60  
Year of Publication: 2004
ISBN:1-58113-945-4
Authors
Sunil Soman  University of California, Santa Barbara, CA
Chandra Krintz  University of California, Santa Barbara, CA
David F. Bacon  IBM T.J. Watson Research Center, Yorktown Heights, NY
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 31,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1029873.1029880
What is a DOI?

ABSTRACT

Much prior work has shown that the performance enabled by garbage collection (GC) systems is highly dependent upon the behavior of the application as well as on the available resources. That is, no single GC enables the best performance for all programs and all heap sizes. To address this limitation, we present the design, implementation, and empirical evaluation of a novel Java Virtual Machine (JVM) extension that facilitates dynamic switching between a number of very different and popular garbage collectors. We also show how to exploit this functionality using annotation-guided GC selection and evaluate the system using a large number of benchmarks. In addition, we implement and evaluate a simple heuristic to investigate the efficacy of switching automatically. Our results show that, on average, our annotation-guided system introduces less than 4% overhead and improves performance by 24% over the worst-performing GC (across heap sizes) and by 7% over always using the popular Generational/Mark-Sweep hybrid.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
 
4
ATTANASIO, C. R., BACON,D.F.,COCCHI, A., AND SMITH,S.A comparative evaluation of parallel garbage collectors. In Proceedings of the Fourteenth Annual Workshop on Languages and Compilers for Parallel Computing (Cumberland Falls, Kentucky, Aug. 2001), vol. 2624 of Lecture Notes in Computer Science, Springer-Verlag.
5
 
6
 
7
BEA SYSTEMS INC. BEA Weblogic JRockit: Java for the enterprise. http://www.bea.com/content/news_events/white_papers/BEA_JRockit_wp.pdf.
 
8
BLACKBURN, S., CHENG,P.,AND MCKINLEY, K. A garbage collection design and bakeoff in jmtk: An efficient extensible java memory management toolkit. Tech. Rep. TR-CS-03-02, Department of Computer Science, FEIT, ANU, Feb 2003. http://eprints.anu.edu.au/archive/00001986/.
9
10
11
12
 
13
14
 
15
16
 
17
HEWLETT-PACKARD COMPANY. NonStop Server for Java Software. Project home page. http://nonstop.compaq.com/view.asp.
18
19
 
20
HUMMEL, J., AZEVEDO, A., KOLSON, D., AND NICOLAU,A. Annotating the Java Bytecodes in Support of Optimization. Journal of Concurrency:Practice and Experience 9, 11 (Nov. 1997), 1003--1016.
 
21
IBM CORPORATION. Persistent Reusable JVM. Project home page. http://www.haifa.il.ibm.com/projects/systems/ rs/persistent.html.
 
22
IBM CORPORATION. WebSphere software platform. Product home page. http://www-3.ibm.com/software/info1/ websphere/index.jsp.
 
23
INC., S. M. The Java Hotspot Virtual Machine White Paper. http://java.sun.com/products/hotspot/docs/whitepaper/Java_HotSpot_WP_Final_4_30_01.html.
 
24
Java Grande Forum. http://www.javagrande.org/.
 
25
JONES, J., AND KAMIN, S. Annotating Java Class Files with Virtual Registers for Performance. Journal of Concurrency: Practice and Experience 12, 6 (May 2000), 389--406.
 
26
 
27
28
 
29
KRINTZ, C., GROVE, D., SARKAR,V.,AND CALDER, B. Reducing the overhead of dynamic compilation. Software: Practice and xperience 32, 8 (2000), 717--738.
30
 
31
 
32
PRINTEZIS, T. Hot-swapping between a mark&sweep and a mark&compact garbage collector in a generational environment. In Usenix Java Virtual Machine Research and Technology Symposium (Monterey, California, Apr. 2001).
 
33
ROSEN, M. BEA's enterprise platform. IDC white paper sponsered by BEA. http://www.bea.com/framework.jsp.
34
 
35
36
 
37
SOMAN, S., KRINTZ, C., AND BACON, D. F. Dynamic Selection of Application-Specific Garbage Collectors. Tech. Rep. 2004-09, Univ. of California, Santa Barbara, Jan 2004. http://www.cs.ucsb.edu/~ckrintz/abstracts/annotgc.html.
 
38
Standard performance evaluation corporation (SpecJVM98 and SpecJBB Benchmarks). http://www.spec.org/.
 
39
UCSB RACELAB: The laboratory for Research on Adaptive Compilation Environments. http://www.cs.ucsb.edu/~racelab.
40
41
42

CITED BY  12

Collaborative Colleagues:
Sunil Soman: colleagues
Chandra Krintz: colleagues
David F. Bacon: colleagues