Stack allocation and synchronization optimizations for Java using escape analysis

ACM Transactions on Programming Languages and Systems

Volumn 25, Issue 6, 2003, Pages 876-910

  Choi, Jong Deok ^a,c   Gupta, Manish ^a,c   Serrano, Mauricio J ^a,d   Sreedhar, Vugranam C ^a,c   Midkiff, Samuel P ^b,e  

^a IBM   (United States)

^b PURDUE UNIVERSITY   (United States)

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

^d INTEL CORPORATION   (United States)

^e Purdue University   (United States)

Author keywords

Connection graphs; Escape analysis; Points to graph

Indexed keywords

CONNECTION GRAPHS; ESCAPE ANALYSIS; POINTS-TO GRAPH; STACK ALLOCATION;

ABSTRACTING; ALGORITHMS; BENCHMARKING; CODES (SYMBOLS); COMPUTER WORKSTATIONS; GRAPH THEORY; INFORMATION RETRIEVAL; OPTIMIZATION; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

JAVA PROGRAMMING LANGUAGE;

EID: 4544301974     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/945885.945892     Document Type: Article

References (49)

1. ALDRICH, J., CHAMBERS, C., SIRER, E. G., AND EGGERS, S. 1999. Static analysis for eliminating unnessary synchronization from Java programs. In Proceedings of the Sixth International Static Analysis Symposium (Venice, Italy).
2. BACON, D. F., KONURU, R., MURTHY, C., AND SERRANO, M. 1998. Thin locks: Featherweight synchronization for Java. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation. Montreal, P.Q. (Canada).
3. BIRKEDAL, L., TOFTE, M., AND VEJLSTRUP, M. 1996. From region inference to von Neumann machines via region representation inference. In Proceedings of the 23rd Annual ACM Symposium on Principles of Programming Languages.
4. BLANCHET, B. 1998. Escape analysis: Correctness, proof, implementation and experimental results. In Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages (San Diego, CA). 25-37.
5. BLANCHET, B. 1999. Escape analysis for object oriented languages: Application to Java. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (Denver, CO).
6. BODGA, J. AND HÖLZLE, U. 1999. Removing unnecessay synchronization in Java. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (Denver, CO).
7. BURKE, M., CARINI, P., CHOI, J.-D., AND HIND, M. 1995. Flow-insensitive interprocedural alias analysis in the presence of pointers. In Proceedings of the 7th Workshop on Languages and Compilers for Parallel Computing, K. Pingali, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (Eds.). Lecture Notes in Computer Science, Vol, 892. Springer-Verlag, Berlin, Germany, 234-250. Extended version published in September 1994 as Res. rep. RC 19546, IBM T. J. Watson Research Center, Yorktown Heights, NY.
8. CHAMBERS, C., PECHTCHANSKI, I., SARKAR, V., SERRANO, M. J., AND SRINIVASAN, H. 1999. Dependence analysis for Java. In Proceedings of the 12th International Workshop on Languages and Compilers for Parallel Computing.
9. CHASE, D. R., WEGMAN, M., AND ZADECK, F. K. 1990. Analysis of pointers and structures. In Proceedings of the SIGPLAN'90 Conference on Programming Language Design and Implementation. SIGPLAN Not. 25, 6, 296-310.
10. CHATTERJEE, R., RYDER, B. G., AND LANDI, W. A. 1999. Relevant context inference. In Proceedings of the 26th Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages.
11. CHENG, B.-C. AND HWU, W.-M. 2000. Modular interprocedural pointer analysis using access paths: Design, implementation, and evaluation. In Proceedings of the ACM SIGPLAN 2000 Conference on Programming Language Design and Implementation.
12. CHOI, J.-D., BURKE, M., AND CARINI, P. 1993. Efficient flow-sensitive interprocedural computation of pointer-induced aliases and side effects. In Proceedings of the 20th Annual ACM SIGACT-SIGPLAN Symposium on the Principles of Programming Languages. 232-245.
13. CHOI, J.-D., GUPTA, M., SERRANO, M., SREEDHAR, V. C., AND MIDRIFF, S. 1999. Escape analysis for Java. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (Denver, CO).
14. CHOI, J.-D., GUPTA, M., SERRANO, M. J., SREEDHAR, V. C., AND MIDKIFF, S. 2002. Stack allocation and synchronization optimizations for Java using escape analysis. Res. rep. RC22340. IBM T. J. Watson Research Center, Yorktown Heights, NY.
15. CORBETT, J. C. 1998. Constructing compact models of concurrent Java programs. In Proceedings of the 1998 International Symposium of Software Testing and Analysis. ACM Press, New York, NY.
16. DEUTSCH, A. 1997. On the complexity of escape analysis. In Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages (San Diego, CA). 358-371.
17. DINIZ, P. AND RINARD, M. 1997. Synchronization transformations for parallel computing. In Proceedings of the 9th Workshop on Languages and Compilers for Parallel Computers.
18. EMAMI, M., GHIYA, R., AND HENDREN, L. 1994. Context-sensitive interprocedural points-to analysis in the presence of function pointers. In Proceedings of the ACM SIGPLAN "94 Conference on Programming Language Design and Implementation. 242-256.
19. FÄHNDRICH, M., REHOF, J., AND DAS, M. 2000. Scalable context-sensitive flow analysis using instantiation constraints. In Proceedings of the ACM SIGPLAN"00 Conference of Programming Language Design and Implementation. 253-263.
20. GAY, D. AND AIKEN, A. 1998. Memory management with explicit regions. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (Montreal, P.Q., Canada).
21. GAY, D. AND STEENSGAARD, B. 2000. Fast escape analysis and stack allocation for object-based programs. In Proceedings of the 2000 International Conference on Compiler Construction. 82-93.
22. GHIYA, R. AND HENDREN, L. J. 1996. Connection analysis: A practical interprocedural heap analysis for C. Int. J. Parallel Program. 24, 6, 547-578.
23. GHIYA, R. AND HENDREN, L. J. 1998. Putting pointer analysis to work. In Proceedings of the 25th Annual ACM Symposium on Principles of Programming Languages (San Diego, CA). 121-133.
24. GOSLING, J., JOY, B., AND STEELE, G. 1996. The Java(™) Language Specification. Addison-Wesley, Reading, MA.
25. GOYAL, D. 2000. A language-theoretic approach to algorithms. Ph.D. dissertation, New York University, New York, NY. Available online at http://cs.nyu.edu/phd_students/deepak/thesis.ps.
26. GUPTA, M., CHOI, J.-D., AND HIND, M. 2000. Optimizing Java programs in the presence of exceptions. In Proceedings of the European Conference on Object-Oriented Programming (Cannes, France). Also available as IBM T. J. Watson Research Center Tech. rep. RC 21644.
27. HANNAN, J. 1995. A type-based analysis for stack allocation in functional languages. In Proceedings of the 2nd International Static Analysis Symposium.
28. IBM Corporation 1997. IBM High Performance Compiler for Java. Available online for download at http://www.alphaWorks.ibm.com/formula.
29. JavaMemoryModel 2002. Java memory model mailing list. Archived at http://www.cs.umd.edu/~pugh/java/memoryModel/archive/.
30. LANDI, W. AND RYDER, B. 1992. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the SIGPLAN "92 Conference on Programming Language Design, and Implementation. SIGPLAN Not. 27, 6, 235-248.
31. LARUS, J. R. AND HILFINGER, P. N. 1988. Detecting conflicts between structure accesses. In Proceedings of the SIGPLAN "88 Conference on Programming Language Design and Implementation. SIGPLAN Not. 23, 7, 21-34.
32. LEE, J., PADUA, D., AND MIDHFF, S. 1999. Basic compiler algorithms for parallel programs. In Proceedings of 1999 ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming. ACM Press, New York, NY.
33. Li, Z. AND ABU-SUFAH, W. 1987. On reducing data synchronization in multiprocessed loops. IEEE Trans. Comput. C-36, 1 (Jan.), 105-109.
34. LUNG, D. AND HARROLD, M. J. 1999. Efficient points-to analysis for whole-program analysis. In Proceedings of the 7th European Software Engineering Conference and 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE"99). 199-215.
35. MANSON, J. AND PUGH, W. 2001. Core semantics of multithreaded Java. In Proceedings of the ACM 2001 ISCOPE/Java Grande Conference. 29-38. A longer version is available as UMCP CS Tech. rep., available online 4215 at http://www.cs.umd.edu/pugh/java/memoryModel/semantics.pdf.
36. MARLOWE, T. J. 1989. Data flow analysis and incremental iteration. Ph.D. dissertation, Rutgers University, New Brunswick, NJ.
37. MIDRIFF, S. P. AND PADUA, D. A. 1987. Compiler algorithms for synchronization. IEEE Trans. Comput. C-36, 12 (Dec.), 1485-1495.
38. OLIVER, M., DECIULESCU, E., AND CLARK, C. 2000. Java positioning paper. Available online at http://www-1.ibm.com/servers/eserver/zseries/software/java/position.html.
39. PARK, Y. AND GOLDBERG, B. 1992. Escape analysis on lists. In Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 117-127.
40. PUGH, W. 1999. Fixing the Java memory model. In Proceedings of the ACM 1999 Java Grande Conference, 89-98.
41. REID, A., McCORQUODALE, J., BAKER, J., HSIEH, W., AND ZACHARY, J. 1999. The need for predictable garbage collection. In Proceedings of the WCSSS"99 Workshop on Compiler Support for System Software.
42. RUF, E. 2000. Effective synchronization removal for Java. In Proceedings of the ACM SIGPLAN"00 Conference of Programming Language Design and Implementation. 208-218.
43. RUGGIERI, C. AND MURTAGH, T. 1988. Lifetime analysis of dynamically allocated objects. In Proceedings of the 15th Annual ACM Symposium on Principles of Programming Languages. 285-293.
44. RUGINA, R. AND RINARD, M. C. 1999. Pointer analysis for multithreaded programs. In Proceedings of the SIGPLAN Conference on Programming Language Design and Implementation. 77-90.
45. SAGIV, M., REPS, T., AND WILHELM, R. 1998. Solving shape-analysis problems in languages with destructive updating. ACM Trans. Program. Lang. Syst. 20, 1 (Jan.), 1-50.
46. TOFTE, M. AND TALPIN, J.-P. 1994. Implementing the call-by-value lambda-calculus using a stack of regions. In Proceedings of the 21st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. ACM Press, New York, NY, 188-201.
47. VIVIEN, F. AND RINARD, M. 2001. Incrementalized pointer and escape analysis. In Proceedings of the ACM SIGPLAN"01 Conference of Programming Language Design and Implementation.
48. WHALEY, J. AND RINARD, M. 1999. Compositional pointer and escape analysis for Java programs. In Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications (Denver, CO).
49. WILSON, R. P. AND LAM, M. S. 1995. Efficient context-sensitive pointer analysis for C programs. In Proceedings of the SIGPLAN "95 Conference on Programming Language Design and Implementation. SIGPLAN Not. 30, 6, 1-12.