Complexity-constrainted partitioning of sequential programs for efficient behavioral synthesis

Authors:
Yuko Hara;Hiroyuki Tomiyama;Shinya Honda;Hiroaki Takada;Katsuya Ishii
Affiliations:
Nagoya University, Nagoya, Japan;Nagoya University, Nagoya, Japan;Nagoya University, Nagoya, Japan;Nagoya University, Nagoya, Japan;Nagoya University, Nagoya, Japan
Venue:
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Year:
2007

Citing 7
Cited 0

High-level synthesis: introduction to chip and system design

High-level synthesis: introduction to chip and system design
Procedure cloning: a transformation for improved system-level functional partitioning

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Partitioning sequential programs for CAD using a three-step approach

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Coordinated parallelizing compiler optimizations and high-level synthesis

ACM Transactions on Design Automation of Electronic Systems (TODAES)
Rapid estimation of control delay from high-level specifications

Proceedings of the 43rd annual Design Automation Conference
Function Call Optimization in Behavioral Synthesis

DSD '06 Proceedings of the 9th EUROMICRO Conference on Digital System Design
Techniques for minimizing and balancing I/O during functional partitioning

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a behavioral level partitioning method for efficient behavioral synthesis from a large sequential program consisting of a set of functions. Our method optimally determines functions to be inlined into the main module and ones to be synthesized into sub modules in such a way that the overall datapath is minimized while the complexity of individual modules is lower than a certain level. The partitioning problem is formulated as an integer programming problem. Experimental results show the effectiveness of the proposed method.