Loop transformations in the ahead-of-time optimization of Java bytecode
Hammond, Simon D. and Lacey, David (2006) Loop transformations in the ahead-of-time optimization of Java bytecode. In: 15th International Conference on Compiler Construction, Vienna, AUSTRIA, MAR 30-31, 2006. Published in: COMPILER CONSTRUCTION, PROCEEDINGS, 3923 pp. 109-123.Full text not available from this repository.
Loop optimizations such as loop unrolling, unfolding and invariant code motion have long been used in a wide variety of compilers to improve the running time of applications. In this paper we present a series of experimental results detailing the effect these techniques have on the running time of Java applications following ahead of time optimization.
We also detail the optimization tools and transformations developed for this paper which extend the SOOT framework discussed in a number of previous papers on the subject. Our experimentation, conducted on the SciMark 2.0 benchmarking suite, demonstrates that when optimized using the techniques mentioned, Java applications can benefit from performance improvements of up to 20%.
We finish with a discussion of the results obtained, including results on how the optimizations affect JIT compilation and class size and proceed to argue that ahead-of-time loop unrolling and unfolding optimization may have a role to play in improving the performance of Java applications, particularly in scientific applications.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||COMPILER CONSTRUCTION, PROCEEDINGS|
|Editor:||Mycroft, A and Zeller, A|
|Number of Pages:||15|
|Page Range:||pp. 109-123|
|Title of Event:||15th International Conference on Compiler Construction|
|Location of Event:||Vienna, AUSTRIA|
|Date(s) of Event:||MAR 30-31, 2006|
Actions (login required)