Register Allocation by Evolutionary Algorithm

Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm...

Full description

Saved in:
Bibliographic Details
Main Authors: Negri Lintzmayer, Carla, Mulati, Mauro Henrique, Faustino da Silva, Anderson
Format: Conference Proceeding
Language:English
Subjects:
Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
HCA
Mathematical model
Register Allocation
Registers
Resource management
Sociology
Statistics
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Graph coloring is a highly effective approach to intraprocedural register allocation. In this paper, we describe a new algorithm for intraprocedural register allocation called HECRA, an algorithm that extends a classic graph coloring register allocator to use a hybrid evolutionary coloring algorithm. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. Besides, HECRA is interesting in contexts where compile time is a concern, and not only the quality of the generated code.
ISSN:1522-4902
2691-0632
DOI:10.1109/SCCC.2012.31