Finding the Best Compiler Optimization Option Set Rapidly via Machine Learning
碩士 === 臺灣大學 === 資訊網路與多媒體研究所 === 95 === For a compiler to find a set of options that result in an optimal program execution is a NP-hard problem, especially when there are a lot of options to choose. For a large program, finding the optimal set of compiler options can take an enormous amount of time....
Main Authors: | Chi-Meng Chen, 陳奇孟 |
---|---|
Other Authors: | Shih-Hao Hung |
Format: | Others |
Language: | en_US |
Published: |
2007
|
Online Access: | http://ndltd.ncl.edu.tw/handle/54363747575578347948 |
Similar Items
-
Memory Utilization and Machine Learning Techniques for Compiler Optimization
by: Shreyas Madhav A V, et al.
Published: (2021-01-01) -
Rapid algorithm for finding the best combination of signaling phases using optimization methods
by: Eleni Papatzikou, et al.
Published: (2018-12-01) -
Exploring Machine Learning Algorithms to Find the Best Features for Predicting Modes of Childbirth
by: Muhammad Nazrul Islam, et al.
Published: (2021-01-01) -
Search-based Optimization for Compiler Machine-code Generation
by: Clauson, Aran
Published: (2013) -
Using Search Space Reduction to Speedup Automatic Compiler Optimization Option Selection
by: Chang,TingKoung, et al.
Published: (2011)