Selective search of inlining vectors for program optimization

Authors:
Rosario Cammarota;Arun Kejariwal;Debora Donato;Alexandru Nicolau;Alexander Veidenbaum
Affiliations:
University of California Irvine, Irvine, CA, USA;Yahoo! Inc., Sunnyvale, CA, USA;Yahoo! Inc., Sunnyvale, CA, USA;University of California Irvine, Irvine, CA, USA;University of California Irvine, Irvine, CA, USA
Venue:
Proceedings of the 9th conference on Computing Frontiers
Year:
2012

Citing 11
Cited 1

Compiling C for vectorization, parallelization, and inline expansion

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
An analysis of inline substitution for a structured programming language

Communications of the ACM
A Machine Learning Approach to Automatic Production of Compiler Heuristics

AIMSA '02 Proceedings of the 10th International Conference on Artificial Intelligence: Methodology, Systems, and Applications
Adaptive online context-sensitive inlining

Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Predicting the effects of optimization on a procedure body

SIGPLAN '79 Proceedings of the 1979 SIGPLAN symposium on Compiler construction
Predicting Unroll Factors Using Supervised Classification

Proceedings of the international symposium on Code generation and optimization
Automatic Tuning of Inlining Heuristics

SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
SPEC CPU2006 benchmark descriptions

ACM SIGARCH Computer Architecture News
Rapidly Selecting Good Compiler Optimizations using Performance Counters

Proceedings of the International Symposium on Code Generation and Optimization
Portable compiler optimisation across embedded programs and microarchitectures using machine learning

Proceedings of the 42nd Annual IEEE/ACM International Symposium on Microarchitecture
An adaptive strategy for inline substitution

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction

On the determination of inlining vectors for program optimization

CC'13 Proceedings of the 22nd international conference on Compiler Construction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel technique to select the inlining options of a compiler - referred to as an inlining vector, for program optimization. The proposed technique trains a machine learning algorithm to model the relation between inlining vectors and performance (completion time). The training set is composed of sample runs of the programs to optimize - that are compiled with a limited number of inlining vectors. Subject to a given compiler, the model evaluates the benefit of inlining combined with other compiler heuristics. The model is subsequently used to select the inlining vector which minimizes the predicted completion time of a program with respect to a given level of optimization. We present a case study based on the compiler GNU GCC. We used our technique to improve performance of 403.gcc from SPEC CPU2006 - a program which is notoriously hard to optimize - with respect to the optimization level -O3 as the baseline. On the state-of-the-art Intel Xeon Westmere architecture, 403.gcc, compiled using the inlining vectors selected by our technique, outperforms the baseline by up to 9%.