Optimal register allocation by augmented left-edge algorithm on arbitrary control-flow structures

A new algorithm for optimal register allocation in context of high-level synthesis is presented. In this paper we show how the greedy left-edge algorithm can be leveraged to obtain a globally optimal allocation, that is computed in polynomial time. By splitting variables at block boundaries, allows...

Full description

Saved in:
Bibliographic Details
Published inNORCHIP 2012 pp. 1 - 6
Main Authors Ruvald Pedersen, Mark, Madsen, J.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2012
Subjects
High-level synthesis
Register allocation
Registers
Online AccessGet full text

Cover

More Information
Summary:A new algorithm for optimal register allocation in context of high-level synthesis is presented. In this paper we show how the greedy left-edge algorithm can be leveraged to obtain a globally optimal allocation, that is computed in polynomial time. By splitting variables at block boundaries, allows for allocation to be done using only quasi-local and local allocation - avoiding the complexity of true global allocation. As local allocation is much simpler than global allocation, this approach emphasizes efficiency and ease of implementation - at a cost of an increased number of register transfers compared to other allocators. Experiments show that runtime is linear for all practical purposes.
ISBN:1467322210
9781467322218
DOI:10.1109/NORCHP.2012.6403107