首页> 外文会议>IEEE International Conference on Field Programmable Technology >A Performance-driven Circuit Bipartitioning Algorithm for Multi-FPGA Implementation with Time-multiplexed I/Os
【24h】

A Performance-driven Circuit Bipartitioning Algorithm for Multi-FPGA Implementation with Time-multiplexed I/Os

机译:具有时间多路复用I / O的多FPGA实现的性能驱动电路双分位算法

获取原文

摘要

For multi-FPGA systems, the limitation of the number of FPGA I/O-pins is one of the most critical issues. Using time-multiplexed I/Os eases the limitation. While, a signal path through n time-multiplexed I/Os makes the system clock period n+1 times longer at most. To capture this feature, we introduce a new cost Total Cut-Hopcount. Under the Total Cut-Hopcount, we propose a performance-driven bipartitioning method VIOP. VIOP combines three algorithms, such that i) min-cut partitioning, ii) coarse performance-driven partitioning, and iii) fine performance-driven partitioning. For min-cut and coarse performance-driven partitioning, we employ well-known bipartitioning algorithms CLIP-FM and DUBA, respectively. For fine performance-driven partitioning, we propose a partitioning algorithm CAVP. By VIOP, the average cost was improved by 11.5% compared with the state-of-the-art algorithms.
机译:对于多FPGA系统,FPGA I / O-PIN的数量的限制是最关键的问题之一。 使用时间多路复用的I / O缓解限制。 虽然,通过N个时间复用I / O的信号路径使系统时钟周期为N +最多1倍。 要捕获此功能,我们介绍了全新的成本剪切淘汰赛。 在总切割跳闸下,我们提出了一种性能驱动的双分位方法VIOP。 viop将三种算法组合,使i)最小剪切分区,ii)粗糙的性能驱动的分区和III)精细性能驱动的分区。 对于敏感和粗略性的性能驱动的分区,我们分别使用了众所周知的双分位算法剪辑CLICK-FM和DUBA。 对于精细性能驱动的分区,我们提出了一个分区算法CAVP。 通过VIOP,与最先进的算法相比,平均成本提高了11.5%。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号