DocumentCode
2991458
Title
Exploiting the special structure of conflict and compatibility graphs in high-level synthesis
Author
Springer, D.L. ; Thomas, D.E.
Author_Institution
Carnegie Mellon Univ., Pittsburgh, PA, USA
fYear
1990
fDate
11-15 Nov. 1990
Firstpage
254
Lastpage
257
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.<>
Keywords
circuit CAD; graph colouring; graph theory; chordal graphs; clique partitioning algorithms; compatibility graphs; high-level synthesis; Contracts; Costs; Graph theory; High level synthesis; Law; Legal factors; Polynomials; Very large scale integration;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1990. ICCAD-90. Digest of Technical Papers., 1990 IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-2055-2
Type
conf
DOI
10.1109/ICCAD.1990.129895
Filename
129895
Link To Document