Object combining: A new aggressive optimization for object intensive programs

Concurrency and Computation: Practice and Experience

Volumn 17, Issue 5-6 SPEC. ISS., 2005, Pages 439-464

  Veldema, Ronald ^a,b   Jacobs, Ceriel J H ^a   Hofman, Rutger F H ^a   Bal, Henri E ^a  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

Author keywords

Garbage collection; Java; Object management

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; INFORMATION ANALYSIS; OPTIMIZATION; SEMANTICS; STORAGE ALLOCATION (COMPUTER);

GARBAGE COLLECTION; OBJECT ALLOCATION; OBJECT MANAGEMENT; POINTERS;

COMPUTER SOFTWARE;

EID: 17444366910     PISSN: 15320626     EISSN: None     Source Type: Journal    
DOI: 10.1002/cpe.836     Document Type: Conference Paper

References (18)

1. Choi J, Gupta M, Serrano M, Sreedhar V, Midkiff S. Escape analysis for Java. Proceedings of OOPSLA'99, Denver, CO, November 1999. ACM Press: New York, 1999; 1-19.
2. Ghemawat S, Randall KH, Scales DJ. Field analysis: Getting useful and low-cost interprocedural information. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, 2000; 334-344.
3. Dolby AACJ. An automatic object inlining optimization and its evaluation. Proceedings of PLDI 2000, Vancouver, BC, Canada, June 2000. ACM Press: New York, 2000; 345-357.
4. Laud P. Analysis for object inlining in Java. Proceedings of JOSES: Java Optimization Strategies for Embedded Systems, Genoa, Italy, April 2001; 1-8.
5. Maassen J, van Nieuwpoort R, Veldema R, Bal H, Plaat A. An efficient implementation of Java's remote method invocation. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Atlanta, GA, May 1999. ACM Press: New York, 1999.
6. Gay D, Aiken A. Language support for regions. Proceedings of PLDI 2001, Snowbird, UT, 2001. ACM Press: New York, 2001; 70-80.
7. Hanson D. Fast allocation and deallocation of memory based on object lifetimes. Software-Practice and Experience 1990; 20(1):5-12.
8. Gagnon E, Hendren LJ, Marceau G. Efficient inference of static types for Java bytecode. Proceedings of the Static Analysis Symposium, 2000; 199-219.
9. Sundaresan V, Hendren LJ, Razafimahefa C, Vallee-Rai R, Lam P, Gagnon E, Godin C. Practical virtual method call resolution for Java. Proceedings of the Conference on Object-Oriented. ACM Press: New York, 2000; 264-280.
10. Cytron R, Ferante J, Rosen BK, Wegman MN, Zadeck FK. An efficient method of computing static single assignment form. Proceedings of the 16th Annual (ACM) Symposium on Principles of Programming Languages, Austin, TX, 1989. ACM Press: New York, 1989; 25-35.
11. Ghiya R, Hendren L. Putting pointer analysis to work. Proceedings of the Symposium on Principles of Programming Languages, San Diego, CA, January 1998. ACM Press: New York, 1998; 121-133.
12. Patterson D, Anderson T, Cardwell N, Fromm R, Keeton K, Kozyrakis C, Thomas R, Yelick K. A case for intelligent RAM. IEEE Micro 1997; 17(2);34-44.
13. Chilimbi TM, Davidson B, Larus JR. Cache-conscious structure definition. Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation, 1999; 13-24.
14. Wilson R, French R, Wilson C, Amarasinghe S, Anderson J, Tjiang S, Liao S, Tseng C, Hall M, Lam M, Hennessy J. SUIF: An infrastructure for research on parallelizing and optimizing compilers. ACM SIGPLAN Notices 1996; 29(12):31-37.
15. Whaley J, Rinard M. Compositional pointer and escape analysis for Java programs. Proceedings of OOPSLA(14), Denver, CO, November 1999; 187-206.
16. Massalin H. Superoptimizer: A look at the smallest program. Proceedings of the 2nd International Conference on Architectural Support for Programming Languages and Operating System (ASPLOS), vol. 22, New York, NY, 1987. ACM Press: New York, 1987; 122-127.
17. Chien AA, Karamcheti V, Plevyak J. The concert system-compiler and runtime support for efficient, fine-grained concurrent object-oriented programs. Technical Report UIUCDCS-R-93-1815, 1993.
18. Truong DN, Bodin F, Seznec A. Improving the cache behaviour of dynamically allocated data structures. Proceedings of PACT 98, October 1998. ACM Press: New York, 1998; 322-329.