Optimal register sharing for high-level synthesis of SSA form programs

Author

Brisk, Philip ; Dabiri, Foad ; Jafari, Roozbeh ; Sarrafzadeh, Majid

Author_Institution

Comput. Sci. Dept., Univ. of California, Los Angeles, CA, USA

Volume

25

Issue

5

fYear

2006

fDate

5/1/2006 12:00:00 AM

Firstpage

772

Lastpage

779

Abstract

Register sharing for high-level synthesis of programs represented in static single assignment (SSA) form is proven to have a polynomial-time solution. Register sharing is modeled as a graph-coloring problem. Although graph coloring is NP-Complete in the general case, an interference graph constructed for a program in SSA form probably belongs to the class of chordal graphs that have an optimal O(|V|+|E|) time algorithm. Chordal graph coloring reduces the number of registers allocated to the program by as much as 86% and 64.93% on average compared to linear scan register allocation.

Keywords

graph colouring; high level synthesis; NP-complete; SSA form program; chordal graph; graph coloring; high-level synthesis; interference graph; optimal register sharing; polynomial-time solution; static single assignment; Computer science; Flow graphs; High level synthesis; Interference; Optimal control; Polynomials; Processor scheduling; Registers; Resource management; Silicon; Compilers (silicon); high-level synthesis;

fLanguage

English

Journal_Title

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on

Publisher

ieee

ISSN

0278-0070

Type

jour

DOI

10.1109/TCAD.2006.870409

Filename

1624511