Compiling and Optimizing Java 8 Programs for GPU Execution
Kazuaki Ishizaki, Akihiro Hayashi, et al.
PACT 2015
In this paper, we present a comparative study of static and profile-based heuristics for inlining. Our motivation for this study is to use the results to design the best inlining algorithm that we can for the Jalapeño dynamic optimizing compiler for Java [6]. We use a well-known approximation algorithm for the KNAPSACK problem as a common "meta-algorithm" for the inlining heuristics studied in this paper. We present performance results for an implementation of these inlining heuristics in the Jalapeño dynamic optimizing compiler. Our performance results show that the inlining heuristics studied in this paper can lead to significant speedups in execution time (up to 1.68x) even with modest limits on code size expansion (at most 10%). © 2000 ACM.
Kazuaki Ishizaki, Akihiro Hayashi, et al.
PACT 2015
Erik R. Altman, Matthew Arnold, et al.
IBM J. Res. Dev
Matthew Arnold, Stephen Fink, et al.
OOPSLA 2000
Vivek Sarkar
ICS 1988