Selective compilation via fast code analysis and bytecode tracing
Selective compilation via fast code analysis and bytecode tracing
复制标题
DOI：
10.1145/1141277.1141488
复制
发表时间：
2006-04
期刊：
影响因子：
--
通讯作者：
G. Agosta;S. Crespi-Reghizzi;P. Palumbo;M. Sykora
中科院分区：
文献类型：
--
作者：
G. Agosta;S. Crespi-Reghizzi;P. Palumbo;M. Sykora
现代Java虚拟机（JVM）通常采用恰当时间（JIT）汇编来加快Java字节码的执行。但是，仅当代码经常执行时，编译代码区域的努力才值得。因此，使用选择性编译，以便仅在执行大多数计算的代码区域（热点）中调用JIT编译器。选择性编译的核心任务是正确识别程序中的热点。在我们的Selekaffe原型虚拟机中，我们引入了两种旨在通过字节码分析以及通过分析信息动态地检测热点的启发式方法。一组代表性基准的实验结果表明，我们的方法选择策略比已知的策略更准确，并且不慢。
Modern Java Virtual Machines (JVM) commonly adopt Just-In-Time (JIT) compilation to speed up the execution of Java Bytecode. However, the effort of compiling a region of code is only worth if the code is frequently executed. Therefore, Selective Compilation is employed so that the JIT compiler is only invoked on those regions of code where most of the computation is performed (hot spots). The core task in Selective Compilation is to correctly identify the hot spots in a program. In our SeleKaffe prototype virtual machine, we introduce two heuristics aimed at detecting hot spots both statically, via bytecode analysis, and dynamically, via profiling information. Experimental results on a representative set of benchmarks show that our method selection strategy is more accurate than known strategies, and not significantly slower.