.png){kind=icon}
返回
Multi-objective adaptive evolutionary strategy for tuning compilations
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2013.07.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Tuning compilations is the process of adjusting the values of a compiler options to improve some features of the final application. In this paper, a strategy based on the use of a genetic algorithm and a multi-objective scheme is proposed to deal with this task. Unlike previous works, we try to take advantage of the knowledge of this domain to provide a problem-specific genetic operation that improves both the speed of convergence and the quality of the results. The evaluation of the strategy is carried out by means of a case of study aimed to improve the performance of the well-known web server Apache. Experimental results show that a 7.5% of overall improvement can be achieved. Furthermore, the adaptive approach has shown an ability to markedly speed-up the convergence of the original strategy. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Tuning compilations
Evolutionary search
Genetic algorithm
Adaptive strategy
Multi-objective optimization
NSGA-II
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
.png){kind=icon}
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏
分享收藏分享收藏On the performance of multiple-objective genetic local search on the 0/1 knapsack problem - A comparative experiment关于多目标遗传局部搜索在0/1背包问题上的性能-比较实验
PREAI
分享收藏
查看更多内容