Array bounds check elimination in the context of deoptimization

Science of Computer Programming

Volumn 74, Issue 5-6, 2009, Pages 279-295

  Würthinger, Thomas ^a   Wimmer, Christian ^a   Mössenböck, Hanspeter ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

Array bounds check elimination; Java; Just in time compilation; Optimization; Performance

Indexed keywords

BENCHMARKING; COMPUTER SOFTWARE; OBJECT ORIENTED PROGRAMMING; PROGRAM COMPILERS;

ARRAY BOUNDS CHECK ELIMINATION; ARRAY ELEMENTS; BENCHMARK SUITES; DE OPTIMIZATIONS; EXECUTION SPEED; HOT SPOTS; INDEX VALUES; INTERMEDIATE REPRESENTATIONS; JAVA; JAVA PROGRAMS; JAVA VIRTUAL MACHINES; JUST-IN-TIME COMPILATION; JUST-IN-TIME COMPILERS; OBJECT-ORIENTED; PERFORMANCE; SIGNIFICANT IMPACTS; STATIC SINGLE ASSIGNMENT FORMS;

JAVA PROGRAMMING LANGUAGE;

EID: 62549104823     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2009.01.002     Document Type: Article

References (28)

1. Aggarwal A., and Randall K.H. Related field analysis. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2001), ACM Press 214-220
2. Blackburn S.M., Garner R., Hoffman C., Khan A.M., McKinley K.S., Bentzur R., Diwan A., Feinberg D., Frampton D., Guyer S.Z., Hirzel M., Hosking A., Jump M., Lee H., Moss J.E.B., Phansalkar A., Stefanović D., VanDrunen T., von Dincklage D., and Wiedermann B. The DaCapo benchmarks: Java benchmarking development and analysis. Proceedings of the ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages and Applications (2006), ACM Press 169-190
3. Bodík R., Gupta R., and Sarkar V. ABCD: Eliminating array bounds checks on demand. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2000), ACM Press 321-333
4. Briggs P., Cooper K.D., and Simpson L.T. Value numbering. Software: Practice and Experience 27 6 (1997) 701-724
5. Bull J.M., Smith L.A., Westhead M.D., Henty D.S., and Davey R.A. A benchmark suite for high performance Java. Concurrency: Practice and Experience 12 6 (2000) 375-388
6. Burke M.G., Choi J.-D., Fink S.J., Grove D., Hind M., Sarkar V., Serrano M.J., Sreedhar V.C., Srinivasan H., and Whaley J. The Jalapeño dynamic optimizing compiler for Java. Proceedings of the ACM Conference on Java Grande (1999), ACM Press 129-141
7. Click C., and Paleczny M. A simple graph-based intermediate representation. Papers from the ACM SIGPLAN Workshop on Intermediate Representations (1995), ACM Press 35-49
8. Cytron R., Ferrante J., Rosen B.K., Wegman M.N., and Zadeck F.K. Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13 4 (1991) 451-490
9. M. Dmitriev, Safe class and data evolution in large and long-lived Java™ applications, Tech. Rep. TR-2001-98, Sun Microsystems Inc., 2001
10. Ghemawat S., Randall K.H., and Scales D.J. Field analysis: getting useful and low-cost interprocedural information. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (2000), ACM Press 334-344
11. Griesemer R., and Mitrovic S. A compiler for the Java HotSpot™ virtual machine. In: Böszörményi L., Gutknecht J., and Pomberger G. (Eds). The School of Niklaus Wirth: The Art of Simplicity (2000), dpunkt.verlag 133-152
12. Gupta R. A fresh look at optimizing array bound checking. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1990), ACM Press 272-282
13. Gupta R. Optimizing array bound checks using flow analysis. ACM Letters on Programming Languages and Systems 2 1-4 (1993) 135-150
14. Hölzle U., Chambers C., and Ungar D. Debugging optimized code with dynamic deoptimization. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1992), ACM Press 32-43
15. Hölzle U., and Ungar D. Optimizing dynamically-dispatched calls with run-time type feedback. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (1994), ACM Press 326-336
16. Hummel J., Azevedo A., Kolson D., and Nicolau A. Annotating the Java bytecodes in support of optimization. Concurrency: Practice and Experience 9 11 (1997) 1003-1016
17. Kawahito M., Komatsu H., and Nakatani T. Effective null pointer check elimination utilizing hardware trap. Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (2000), ACM Press 139-149
18. Kotzmann T., Wimmer C., Mössenböck H., Rodriguez T., Russell K., and Cox D. Design of the Java HotSpot™ client compiler for Java 6. ACM Transactions on Architecture and Code Optimization 5 1 (2008) article 7
19. Mikheev V.V., Fedoseev S.A., Sukharev V.V., and Lipsky N.V. Effective enhancement of loop versioning in Java. Proceedings of the International Conference on Compiler Construction. LNCS vol. 2304 (2002), Springer-Verlag 101-115
20. M. Paleczny, C. Vick, C. Click, The Java HotSpot ™ server compiler, in: Proceedings of the Java Virtual Machine Research and Technology Symposium, 2001, pp. 1-12
21. R. Pozo, B. Miller, SciMark 2.0, 1999. http://math.nist.gov/scimark2/
22. Qian F., Hendren L.J., and Verbrugge C. A comprehensive approach to array bounds check elimination for Java. Proceedings of the International Conference on Compiler Construction. LNCS vol. 2304 (2002), Springer-Verlag 325-342
23. Standard Performance Evaluation Corporation, The SPECjvm98 Benchmarks, 1998. http://www.spec.org/jvm98/
24. Sun Microsystems Inc., Java Platform, Standard Edition 7 Source Snapshot Releases, 2007. http://download.java.net/jdk7/
25. Sun Microsystems Inc., Java™ Platform Debugger Architecture, 2007. http://java.sun.com/javase/6/docs/technotes/guides/jpda/
26. Wimmer C., and Mössenböck H. Optimized interval splitting in a linear scan register allocator. Proceedings of the ACM/USENIX International Conference on Virtual Execution Environments (2005), ACM Press 132-141
27. Würthinger T., Wimmer C., and Mössenböck H. Array bounds check elimination for the Java HotSpot™ client compiler. Proceedings of the International Conference on Principles and Practice of Programming in Java (2007), ACM Press 125-133
28. Xi H., and Xia S. Towards array bound check elimination in Java™ virtual machine language. Proceedings of the Conference of the Centre for Advanced Studies on Collaborative Research (1999), IBM Press 110-125