Port assignment for interconnect reduction in high-level synthesis

Hao Cong, Song Chen, Takeshi Yoshimura

研究成果: Conference contribution

3 被引用数 (Scopus)

抄録

This paper focuses on the Port Assignment Problem for Binary Commutative Operators (PAP-BCO) in high-level synthesis. Given a binding of operations and variables, the PAP-BCO pursues to build the connections of registers to functional units with an objective of minimizing the number of interconnections. In this paper, we formulate the PAP-BCO as a vertex partitioning problem on a graph, and propose an exact Integer Linear Programming (ILP) based method and a fast iterative method based on elementary transformations of spanning tree to solve it. Experimental results show that the fast iterative algorithm can get the optimum solutions in 97% runs. At the same time, the running time is only tens of milliseconds for the maximum test case with 64 registers and 140 operations, on which the ILP based method ran out of time.

本文言語English
ホスト出版物のタイトル2012 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2012 - Proceedings of Technical Papers
DOI
出版ステータスPublished - 2012
イベント2012 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2012 - Hsinchu
継続期間: 2012 4 232012 4 25

Other

Other2012 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2012
CityHsinchu
Period12/4/2312/4/25

ASJC Scopus subject areas

  • ハードウェアとアーキテクチャ

フィンガープリント

「Port assignment for interconnect reduction in high-level synthesis」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル