Christoph Bockisch, Sebastian Kanthak, et al.
ACM SIGPLAN Notices
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.
Christoph Bockisch, Sebastian Kanthak, et al.
ACM SIGPLAN Notices
Matthew Harren, Michael Burke, et al.
WWW 2004
Kourosh Gharachorloo, Vivek Sarkar, et al.
LFP 1988
Ajeet Shankar, Matthew Arnold, et al.
OOPSLA 2008