Register allocation via graph coloring using an evolutionary algorithm

Authors:
Sevin Shamizi;Shahriar Lotfi
Affiliations:
Department of Computer, Shabestar Branch, Islamic Azad University, Shabestar, Iran;Computer Science Department, University of Tabriz, Tabriz, Iran
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part II
Year:
2011

Citing 5
Cited 0

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Register allocation via graph coloring

Register allocation via graph coloring
Register allocation & spilling via graph coloring

SIGPLAN '82 Proceedings of the 1982 SIGPLAN symposium on Compiler construction
Optimal register allocation for SSA-form programs in polynomial time

Information Processing Letters
Solving the Register Allocation Problem for Embedded Systems Using a Hybrid Evolutionary Algorithm

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Register allocation is one of most important compiler optimization techniques. The most famous method for register allocation is graph coloring and the solution presented in this paper (RAGCES) is based on the graph coloring too; for coloring interference graph, evolutionary algorithm is used. In this method graph coloring and selecting variables for spilling is taken place at the same time. This method was tested on several graphs and results were compared with the results of the previous methods.