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

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

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 constructe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computer-aided design of integrated circuits and systems 2006-05, Vol.25 (5), p.772-779
Hauptverfasser: Brisk, P., Dabiri, F., Jafari, R., Sarrafzadeh, M.
Format: Artikel
Sprache:eng
Schlagworte:
Compilers (silicon)
Computer aided design
Computer science
Design engineering
Flow graphs
Graphs
High level synthesis
Integrated circuits
Interference
Interference graphs
Optimal control
Optimization
Polynomials
Processor scheduling
Registers
Resource management
Silicon
Synthesis
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0278-0070
1937-4151
DOI:10.1109/TCAD.2006.870409