Method-specific dynamic compilation using logistic regression
John Cavazos, Michael O’Boyle · ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA) · 2006
Determining the best set of optimizations to apply to a program has been a long standing problem for compiler writers. To reduce the complexity of this task, existing approaches typically apply the same set of optimizations to all procedures within a program, without regard to their particular structure. This paper develops a new method-specific approach that automatically selects the best optimizations on a per method basis within a dynamic compiler. Our approach uses the machine learning technique of logistic regression to automatically derive a predictive model that determines which optimizations to apply based on the features of a method. This technique is implemented in the Jikes RVM Java JIT compiler. Using this approach we reduce the average total execution time of the SPECjvm98 benchmarks by 29%. When the same heuristic is applied to the DaCapo+ benchmark suite, we obtain an average 33% reduction over the default level O2 setting.
Cited by 103 works. doi:10.1145/1167473.1167492
Authors
References
- Neural networks for pattern recognition
- Proceedings of the 24th international conference on Machine learning
- The DaCapo benchmarks
- The Jalapeño virtual machine
- Oxford University Press
- Using Machine Learning to Focus Iterative Optimization
- Compiler Optimization-Space Exploration
- Meta optimization
- A comparison of empirical and model-driven optimization
- Finding effective compilation sequences