A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem

Lecture Notes in Computer Science(2004)

引用 3|浏览8
暂无评分
摘要
One of the strong impacts on runtime performance of a given code is the register allocation phase of compilation. It is crucial to provide aggressive and sophisticated register allocators for the embedded devices, where the excessive compilation time is tolerated because of its off-line nature. In this paper, we present a hybrid evolutionary algorithm for register allocation problem that combines genetic algorithms with a local search technique. Our algorithm exploits a novel, highly-specialized crossover operator that considers domain-specific information. Computational experiments performed on various synthetic benchmarks prove that our method significantly outperform the state-of-the-art, algorithms with respect to all given comparison metrics on solution quality.
更多
查看译文
关键词
local search,genetic algorithm,register allocation,computer experiment
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要