Data communication estimation and reduction for reconfigurable systems

A. Kaplan, P. Brisk, R. Kastner
{"title":"Data communication estimation and reduction for reconfigurable systems","authors":"A. Kaplan, P. Brisk, R. Kastner","doi":"10.1145/775832.775987","DOIUrl":null,"url":null,"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 /spl Phi/-nodes by current SSA algorithms is not optimal in terms of minimizing data communication. We propose a new algorithm which optimally places /spl Phi/-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.","PeriodicalId":167477,"journal":{"name":"Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/775832.775987","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

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 /spl Phi/-nodes by current SSA algorithms is not optimal in terms of minimizing data communication. We propose a new algorithm which optimally places /spl Phi/-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.
可重构系统的数据通信估计与缩减
可重构设备的广泛采用需要系统级综合技术,以采用高级语言编写的应用程序并将其映射到可重构设备。本文描述了将编译器的内部表示合成为硬件描述语言的方法,以便对可重构硬件设备进行编程。我们演示了静态单分配(SSA)在减少硬件中的数据通信量方面的有用性。然而,就最小化数据通信而言,当前SSA算法对/spl Phi/-节点的放置并不是最优的。我们提出了一种新的算法,可以最优地放置/spl Phi/-节点,进一步减少面积和通信延迟。与最著名的SSA算法(修剪算法)相比,我们的算法在某些应用程序中减少了多达20%的数据通信(以控制数据流图中的总边权来衡量)。我们还描述了将来对模型的修改,这些修改将提高我们方法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信