Dynamic selection of application-specific garbage collectors

International Symposium on Memory Management, ISMM

Volumn , Issue , 2004, Pages 49-60

  Soman, Sunil ^a   Krintz, Chandra ^a   Bacon, David F ^b  

^a University of California   (United States)

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

Author keywords

Annotation; Application specific collection; Dynamic selection; Hot swapping; Java; Virtual machine

Indexed keywords

ALGORITHMS; DATA STORAGE EQUIPMENT; ELECTRONIC COMMERCE; HEURISTIC METHODS; PROGRAM COMPILERS; SERVERS; SWITCHING; VIRTUAL REALITY;

ANNOTATION; APPLICATION-SPECIFIC COLLECTION; APPLICATION-SPECIFIC GARBAGE COLLECTORS; DYNAMIC SELECTION; HOT-SWAPPING; JAVA VIRTUAL MACHINES (JVM);

JAVA PROGRAMMING LANGUAGE;

EID: 20744441062     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1029873.1029880     Document Type: Conference Paper

References (42)

1. AIKEN, A., AND GAY, D. Memory management with explicit regions. In Proceedings of the ACM SIGPLAN'98 Conference on Programming Language Design and Implementation (May 1998).
2. ALPERN, B., ET AL. The Jalapeno Virtual Machine. IBM Systems Journal 39, 1 (2000), 211-221.
3. APPEL, A. W. Simple generational garbage collection and fast allocation. Software Practice and Experience 19, 2 (1989), 171-183.
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. BACON, D. F., ATTANASIO, C. R., LEE, H. B., RAJAN, V., AND SMITH, S. E. Java without the coffee breaks: A non-intrusive multiprocessor garbage collector. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) (Snowbird, Utah, Jun 2001).
6. BACON, D. F., FINK, S. J., AND GROVE, D. Space- and time-efficient implementation of the Java object model. In Proceedings of the Sixteenth European Conference on Object-Oriented Programming (Malaga, Spain, June 2002), B. Magnusson, Ed., vol. 2374 of Lecture Notes in Computer Science, Springer-Verlag, pp. 111-132.
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, AMU, Feb 2003. http://eprints.anu.edu.au/archive/00001986/.
9. BLACKBURN, S., AND MCKINLEY, K. In or out? putting write barriers in their place. In ACM SIGPLAN International Symposium on Memory Management (ISMM) (2002).
10. BLACKBURN, S., MOSS, J., MCKINLEY, K., AND STEPHANOVIC, D. Pretenuring for Java. In Proceedings of the Conference on Object-Oriented Programming Systems, Languages, and Applications (OOPSLA) (Tampa, FL, Oct 2001).
11. BLACKBURN, S. M., JONES, R., MCKINLEY, K. S., AND MOSS, J. E. B. Beltway: Getting around garbage collection gridlock. In Proceedings of PLDI'02 Programming Language Design and Implementation (June 2002).
12. BRECHT, T., ARJOMANDI, E., LI, C., AND PHAM, H. Controlling garbage collection and heap growth to reduce execution time of Java applications. In ACM Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'01) (Nov. 2001).
13. CAHOON, B., AND MCKINLEY, K. Data Flow Analysis for Software Prefetching Linked Data Structures in Java Controller. In International Conference on Parallel Architectures and Compilation Techniques (Sept. 2001).
14. CLINGER, W., AND HANSEN, L. T. Generational garbage collection and the radioactive decay model. In Proceedings of the ACM SIGPLAN'97 Conference on Programming Language Design and Implementation (May 1997), pp. 97-108.
15. FINK, S., AND QIAN, F. Design, Implementation and Evaluation of Adaptive Recompilation with On-Stack Replacement. In International Symposium on Code Generation and Optimization (CGO) (Mar. 2003).
16. FITZGERALD, R., AND TARDITI, D. The case for profile-directed selection of garbage collectors. In Proceedings of the second international symposium on Memory management (2000), ACM Press, pp. 111-120.
17. HEWLETT-PACKARD COMPANY. NonStop Server for Java Software. Project home page. http://nonstop.compaq.com/view.asp.
18. HICKS, M., HORNOF, L., MOORE, J., AND NETTLES, S. A study of large object spaces. In ISMM98 (Mar. 1999).
19. HIRZEL, M., DIWAN, A., AND HERTZ, M. Connectivity-based garbage collection. In ACM Conference on Object-Oriented Systems, Languages and Applications (OOPSLA) (Anaheim, CA, Nov. 2003), SIGPLAN Notices, Association for Computing Machinery.
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. JONES, R. E. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
27. KRINTZ, C. Coupling On-Line and Off-Line Profile Information to Improve Program Performance. In International Symposium on Code Generation and Optimization (CGO) (Mar. 2003).
28. KRINTZ, C., AND CALDER, B. Using Annotation to Reduce Dynamic Optimization Time. In Proceedings of the ACM SIGPLAN 2001 Conference on Programming Language Design and Implementation (June 2001), pp. 156-167.
29. KRINTZ, C., GROVE, D., SARKAR, V., AND CALDER, B. Reducing the overhead of dynamic compilation. Software: Practice and Experience 32, 8 (2000), 717-738.
30. LANG, B., AND DUPONT, F. Incremental incrementally compacting garbage collection. In Proc. of the SIGPLAN'87 Symposium on Interpreters and Interpretive Techniques (St. Paul, Minnesota, 1987), pp. 253-263.
31. POMINVILLE, P., QIAN, F., VALLEE-RAI, R., HENDREN, L., AND VERBRUGGE, C. A Framework for Optimizing Java Using Attributes. In Proceedings of IBM Centre for Advanced Studies Conference (GASCON) (2000), pp. 152-168. http://www.sable.mcgill.ca/publications.
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 sponsored by BEA. http://www.bea.com/framework.jsp.
34. SACHINDRAN, N., ELIOT, J., AND MOSS, B. Mark-copy: Fast copying gc with less space overhead. In Proceedings of the 18th ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications (2003), ACM Press, pp. 326-343.
35. SANSOM, P. Combining single-space and two-space compacting garbage collectors. In Proceedings of the 1991 Glasgow Workshop on Functional Programming (Portree, Scotland, 1992), R. Heldal, C. K. Holst, and P. Wadler, Eds., Workshops in Computing, Springer-Verlag, pp. 312-323.
36. SMITH, F., AND MORRISETT, G. Comparing mostly-copying and mark-sweep conservative collection. In Proceedings of the first international symposium on Memory management (1998), ACM Press, pp. 68-78.
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. UNGAR, D. Generation scavenging: A non-disruptive high performance storage recalamation algorithm. In Proceedings of the ACM SIGSOFT/SIIGPLAN Software Engineering Symposium on Practical Software Development Environments (Pittsburg, Pennsylvania, Apr 1992).
41. UNGAR, D., AND JACKSON, F. An adaptive tenuring policy for generation scavengers. ACM Transactions on Programming Languages and Systems 14, 1 (1992), 1-27.
42. ZORN, B. Comparing mark-and sweep and stop-and-copy garbage collection. In Proceedings of the 1990 ACM conference on LISP and functional programming (1990), ACM Press, pp. 87-98.