Abstract
Identifying the suitable set of optimization options and determining nearly optimal values for the compiler parameter set in modern day compilers is a combinatorial problem. These values not only depend on the underlying target architecture and application source, but also on the optimization objective. Standard optimization options provide inferior solutions and also often specific to a particular optimization objective. Most common requirement of the current day systems is to optimize with multiple objectives, especially among average execution time, size and power. In this paper we apply Genetic Algorithm using Weighted Cost Function to obtain the best set of optimization options and optimal parameter set values for the multi-objective optimization of average execution time and code size. The effectiveness of this approach is demonstrated with the benchmark programs from SPEC 2006 benchmark suite. It is observed that the results obtained with parameter tuning and optimization option selection are better or equal to the results obtained with ‘-Ofast’ option in terms of execution time and at the same time equal to ’-Os’ option in terms of code size.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Haneda, M., Knijnenburg, P.M.W., Wijshoff, H.A.G.: Automatic Selection of Compiler Options using Non-Parametric Inferential statistics. In: 14th International Conference on Parallel Architectures and Compilation Techniques (PACT 2005) (2005)
Adve, V.: The Next Generation of Compilers. In: Proc. of CGO (2009)
Duranton, M., Black-Schaffer, D., Yehia, S., De Bosschere, K.: Computing Systems: Research Challenges Ahead The HiPEAC Vision 2011/2012
Kulkarni, P.A., Hines, S.R., Whalley, D.B., et al.: Fast and Efficient Searches for Effective Optimization-phase Sequences. Transactions on Architecture and Code Optimization (2005)
Leather, H., O’Boyle, M., Worton, B.: Raced Profiles: Efficient Selection of Competing Compiler Optimizations. In: Proc. of LCTES (2009)
Agakov, F., Bonilla, E., Cavazos, J., et al.: Using Machine Learning to Focus Iterative Optimization. In: Proc. of CGO (2006)
Cooper, K.D., Schielke, P.J., Subramanian, D.: Optimizing for Reduced Code Space using Genetic Algorithms. SIGPLAN Not. 34(7) (1999)
Khedkar, U., Govindrajan, R.: Compiler Analysis and Optimizations: What is New? In: Proc. of Hipc (2003)
Beszédes, Á., Gergely, T., Gyimóthy, T., Lóki, G., Vidács, L.: Optimizing for Space: Measurements and Possibilities for Improvement. In: Proc. of GCC Developers Summit (2003)
GCC, the GNU Compiler Collection - online documentation, http://gcc.gnu.org/onlinedocs/
Novillo, D.: Performance Tuning with GCC. Red Hat Magazine (September 2005)
SPEC-Standard Performance Evaluation Corporation, http://www.spec.org/cpu2006
Haupt, R.L., Haupt, S.E.: Practical Genetic Algorithms. Wiley Interscience (2004)
Timothy Marler, R., Arora, J.S.: The weighted sum method for multi-objective optimization: New insights. Journal on Structural and Multidisciplinary Optimization (2009), doi:10.1007/s00158-009-0460-7
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Chebolu, N.A.B.S., Wankar, R. (2014). Multi-objective Exploration for Compiler Optimizations and Parameters. In: Murty, M.N., He, X., Chillarige, R.R., Weng, P. (eds) Multi-disciplinary Trends in Artificial Intelligence. MIWAI 2014. Lecture Notes in Computer Science(), vol 8875. Springer, Cham. https://doi.org/10.1007/978-3-319-13365-2_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-13365-2_3
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13364-5
Online ISBN: 978-3-319-13365-2
eBook Packages: Computer ScienceComputer Science (R0)