DMCA
Just-in-time optimization for high-performance Java programs (1997)
| Venue: | Java for Computational Science and Engineering - Simulation and Modeling II, Las Vegas, NV |
| Citations: | 27 - 0 self |
BibTeX
@INPROCEEDINGS{Cierniak97just-in-timeoptimization,
author = {Michał Cierniak and Wei Li},
title = {Just-in-time optimization for high-performance Java programs},
booktitle = {Java for Computational Science and Engineering - Simulation and Modeling II, Las Vegas, NV},
year = {1997}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Our previous experience with an off-line Java optimizer [1] has shown that some traditional algorithms used in compilers are too slow for a JIT compiler. In this paper we propose and implement faster ways of performing analyses needed for our optimizations. For instance we have replaced reaching definitions with constant values and loop induction variables with loop-defined variables. As the result our JIT compiler, Briki, is very fast, so that its running time is negligible even when the data sets used with our benchmarks result in execution times of only a few seconds. The impact for the same benchmarks running on more realistic problem sizes would be even smaller. Currently the speedups resulting from applying our optimizations are between 10 % and 20%, but when the JIT compiler will perform standard optimizations which are absent in the current version of the JIT compiler used by us, the speedups should be similar to the ones observed for Fortran programs—up to 50%. 1
Keyphrases
jit compiler high-performance java program just-in-time optimization traditional algorithm constant value standard optimization data set loop induction variable running time current version realistic problem size execution time off-line java optimizer fortran program previous experience loop-defined variable
