Title :
Behavioral network graph unifying the domains of high-level and logic synthesis
Author :
Bergamaschi, Reinaldo A.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
High-level synthesis operates on internal models known as control/data flow graphs (CDFG) and produces a register-transfer-level (RTL) model of the hardware implementation for a given schedule. For high-level synthesis to be efficient it has to estimate the effect that a given algorithmic decision (e.g., scheduling, allocation) will have on the final hardware implementation (after logic synthesis). Currently, this effect cannot be measured accurately because the CDFGs are very distinct from the RTL/gate-level models used by logic synthesis, precluding interaction between high-level and logic synthesis. This paper presents a solution to this problem consisting of a novel internal model for synthesis which spans the domains of high-level and logic synthesis. This model is an RTL/gate-level network capable of representing all possible schedules that a given behavior may assume. This representation allows high-level synthesis algorithms to be formulated as logic transformations and effectively interleaved with logic synthesis
Keywords :
data flow graphs; formal verification; high level synthesis; scheduling; Hiasynth system; allocation; behavioral network graph; control/data flow graphs; design-space exploration; gate-level models; high-level formal verification; high-level synthesis; interleaved algorithms; internal model; logic synthesis; logic transformations; register-transfer-level model; scheduling; Computer networks; Costs; Flow graphs; Hardware; High level synthesis; Logic; Network synthesis; Processor scheduling; Resource management; Scheduling algorithm;
Conference_Titel :
Design Automation Conference, 1999. Proceedings. 36th
Conference_Location :
New Orleans, LA
Print_ISBN :
1-58113-092-9
DOI :
10.1109/DAC.1999.781314