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

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

Saved in:
Bibliographic Details
Main Authors: Springer, D.L., Thomas, D.E.
Format: Conference Proceeding
Language:English
Subjects:
Contracts
Costs
Graph theory
High level synthesis
Law
Legal factors
Polynomials
Very large scale integration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.< >
DOI:10.1109/ICCAD.1990.129895