Abstract
Fast dynamic compilers trade code quality for short compilation time in order to balance application performance and startup time. This paper investigates the interplay of two of the most effective optimizations, register allocation and method inlining for such compilers. We present a bytecode representation which supports offline global register allocation, is suitable for fast code generation and verification, and yet is backward compatible with standard Java bytecode. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Yamauchi, H., & Vitek, J. (2006). Combining offline and online optimizations: Register allocation and method inlining. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4279 LNCS, pp. 307–322). Springer Verlag. https://doi.org/10.1007/11924661_19
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
