Multi-hop routing of multi-terminal nets for evaluation of hybrid multi-FPGA boards

S. Jain, Anshul Kumar, Shashi Kumar
{"title":"Multi-hop routing of multi-terminal nets for evaluation of hybrid multi-FPGA boards","authors":"S. Jain, Anshul Kumar, Shashi Kumar","doi":"10.1109/FPT.2002.1188696","DOIUrl":null,"url":null,"abstract":"In rapid prototyping system application, any large digital circuit can be implemented onto Multi-FPGA Board(MFB). Key MFB architectural feature is its inter-FPGA connections consisting of fixed connections(FC) i.e. FPGA-FPGA connections and programmable connections(PC) i.e. FPGA-programmable switch like FPID-FPGA. MFBs consisting of both the types of connections are known as hybrid MFBs. Since, PC requires two wires as against one wire in FC, MFB must have minimum number of PCs to keep fabrication easy. In partitioned circuit, multi-terminal nets (MTNs) are distributed over one or more circuit parts. When each circuit part is implemented over one FPGA, the MTNs between circuit parts will be routed over PCs and FCs between corresponding FPGAs. Multi-hop routers are used to minimize the use of PCs, but they increase source to sink delay with increasing number of hops. A generic multi-hop router to route two-terminal nets, which obeys the given limit on hops, was presented in our previous work [2002]. In this paper, we extend the same to route multi-terminal nets.","PeriodicalId":355740,"journal":{"name":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Conference on Field-Programmable Technology, 2002. (FPT). Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FPT.2002.1188696","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In rapid prototyping system application, any large digital circuit can be implemented onto Multi-FPGA Board(MFB). Key MFB architectural feature is its inter-FPGA connections consisting of fixed connections(FC) i.e. FPGA-FPGA connections and programmable connections(PC) i.e. FPGA-programmable switch like FPID-FPGA. MFBs consisting of both the types of connections are known as hybrid MFBs. Since, PC requires two wires as against one wire in FC, MFB must have minimum number of PCs to keep fabrication easy. In partitioned circuit, multi-terminal nets (MTNs) are distributed over one or more circuit parts. When each circuit part is implemented over one FPGA, the MTNs between circuit parts will be routed over PCs and FCs between corresponding FPGAs. Multi-hop routers are used to minimize the use of PCs, but they increase source to sink delay with increasing number of hops. A generic multi-hop router to route two-terminal nets, which obeys the given limit on hops, was presented in our previous work [2002]. In this paper, we extend the same to route multi-terminal nets.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多终端网络的多跳路由,用于混合多fpga板的评估
在快速成型系统应用中,任何大型数字电路都可以在多fpga板(MFB)上实现。MFB的主要架构特征是它的fpga间连接,包括固定连接(FC),即FPGA-FPGA连接和可编程连接(PC),即fpga -可编程开关,如FPGA-FPGA。由这两种类型的连接组成的mfb被称为混合mfb。由于PC需要两根电线而不是FC中的一根电线,因此MFB必须具有最少数量的PC以保持制造容易。在分区电路中,多终端网(mtn)分布在一个或多个电路部件上。当每个电路部分在一个FPGA上实现时,电路部分之间的mtn将通过pc和相应FPGA之间的fc路由。多跳路由器是为了尽量减少pc的使用,但是随着跳数的增加,它们会增加源到接收的延迟。我们在之前的工作[2002]中提出了一种通用的多跳路由器,它遵循给定的跳数限制来路由双终端网络。在本文中,我们将其扩展到路由多终端网络。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Evolution-based automated reconfiguration of field programmable analog devices Clustered programmable-reconfigurable processors Design and implementation of a novel architecture for symmetric FIR filters with boundary handling on Xilinx Virtex FPGAs Serial-parallel tradeoff analysis of all-pairs shortest path algorithms in reconfigurable computing A co-simulation study of adaptive EPIC computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1