Presentation 2012-01-26
Interconnect Reduction in Binding Procedure of HLS
Hao Cong, Song Chen, Takeshi Yoshimura,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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 ele- mentary transformations of spanning tree to solve it. Experimental results show that the fast iterative algorithm can get the optimum solutions in 97% runs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper # VLD2011-109,CPSY2011-72,RECONF2011-68
Date of Issue

Conference Information
Committee RECONF
Conference Date 2012/1/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Reconfigurable Systems (RECONF)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Interconnect Reduction in Binding Procedure of HLS
Sub Title (in English)
Keyword(1)
1st Author's Name Hao Cong
1st Author's Affiliation Graduate School of IPS, Waseda University()
2nd Author's Name Song Chen
2nd Author's Affiliation Graduate School of IPS, Waseda University
3rd Author's Name Takeshi Yoshimura
3rd Author's Affiliation Graduate School of IPS, Waseda University
Date 2012-01-26
Paper # VLD2011-109,CPSY2011-72,RECONF2011-68
Volume (vol) vol.111
Number (no) 399
Page pp.pp.-
#Pages 3
Date of Issue