Exploiting the special structure of conflict and compatibility graphs in high-level synthesis

Abstract

Two types of graphs are presented: chordal graphs and comparability graphs. Chordal graphs guarantee a minimum number of registers on a larger number of designs. Comparability graphs reduce the complexity and improve clique partitioning algorithms used in high-level synthesis.<>