DocumentCode
3566948
Title
Data communication estimation and reduction for reconfigurable systems
Author
Kaplan, Adam ; Brisk, Philip ; Kastner, Ryan
Author_Institution
Comput. Sci. Dept., California Univ., Los Angeles, CA, USA
fYear
2003
Firstpage
616
Lastpage
621
Abstract
Widespread adoption of reconfigurable devices requires system level synthesis techniques to take an application written in a high level language and map it to the reconfigurable device. This paper describes methods for synthesizing the internal representation of a compiler into a hardware description language in order to program reconfigurable hardware devices. We demonstrate the usefulness of static single assignment (SSA) in reducing the amount of data communication in the hardware. However, the placement of Φ-nodes by current SSA algorithms is not optimal in terms of minimizing data communication. We propose a new algorithm which optimally places Φ-nodes, further decreasing area and communication latency. Our algorithm reduces the data communication (measured as total edge weight in a control data flow graph) by as much as 20% for some applications as compared to the best-known SSA algorithm - the pruned algorithm. We also describe future modifications to our model that should increase the effectiveness of our methods.
Keywords
data communication; hardware description languages; high level synthesis; reconfigurable architectures; control data flow graph; data communication estimation; hardware description language; pruned algorithm; reconfigurable system; static single assignment; system level synthesis; Application software; Application specific integrated circuits; Circuit synthesis; Data communication; Field programmable gate arrays; Hardware design languages; Logic design; Logic devices; Microprocessors; Reconfigurable logic;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation Conference, 2003. Proceedings
Print_ISBN
1-58113-688-9
Type
conf
DOI
10.1109/DAC.2003.1219092
Filename
1219092
Link To Document