| Autor: |
Cierniak, Michał, Li, Wei |
| Předmět: |
|
| Zdroj: |
Concurrency, Practice & Experience; Nov1997, Vol. 9 Issue 11, p1063-1073, 11p |
| Abstrakt: |
Our previous experience with an off-line Java optimizer 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 a 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 performs standard optimizations which are absent in the current version of the JIT compiler used by us, thespeedups should be similar to the ones observed for Fortran programs – up to 50%. © 1997 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Plný text