Register Allocation with Graph Coloring by Ant Colony Optimization

The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to u...

Full description

Saved in:
Bibliographic Details
Published in2011 30th International Conference of the Chilean Computer Science Society pp. 247 - 255
Main Authors Lintzmayer, C. N., Mulati, M. H., da Silva, A. F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2011
Subjects
Ant Colony Optimization
Color
ColorAnt-RT
Equations
Graph Coloring
Heuristic algorithms
Interference
Mathematical model
Register Allocation
Registers
Resource management
Online AccessGet full text
ISBN9781467313643
1467313645
ISSN1522-4902
DOI10.1109/SCCC.2011.32

Cover

More Information
Summary:The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to use our graph coloring algorithm Color Ant-RT. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. CA-RT-RA is interesting in applications where compile time is not a concern, but the code quality.
ISBN:9781467313643
1467313645
ISSN:1522-4902
DOI:10.1109/SCCC.2011.32