| 自动修复短时序违反路径的FPGA布线算法 |
| |
| 引用本文： | 刘 洋,杨海钢,喻 伟,蔡 刚,徐维涛.自动修复短时序违反路径的FPGA布线算法[J].计算机应用研究,2014,31(1):66-69. |
| |
| 作者姓名： | 刘 洋 杨海钢 喻 伟 蔡 刚 徐维涛 |
| |
| 作者单位： | 1. 中国科学院电子学研究所可编程芯片与系统研究室, 北京 100190; 2. 中国科学院大学, 北京 100049 |
| |
| 基金项目： | 国家科技重大专项资助项目（2013ZX03006004）; 国家自然科学基金资助项目（61106033） |
| |
| 摘 要： | 为了解决寄存器保持时间不满足而引起的短路径问题, 提出一种自动修复短时序违反路径的FPGA布线算法。在VPR时序布线算法整体布线布通之后, 调用短路径时序分析来获取违反短时序约束的布线连接, 然后通过修改代价函数, 对每条违反短时序约束的连接进行增量布线, 使每条连接的路径延时尽可能达到满足短时序约束所需的延时。实验结果表明, 本算法与VPR时序驱动布线算法相比, 能够平均修复94. 7%的短时序违反路径, 而运行时间仅增加了6. 8%。
|
| 关 键 词： | FPGA 布线 短时序违反路径 代价函数 增量布线 |
Automatic repairing short-path violations FPGA routing algorithm |
| |
| LIU Yang,YANG Hai-gang,YU Wei,CAI Gang,XU Wei-tao.Automatic repairing short-path violations FPGA routing algorithm[J].Application Research of Computers,2014,31(1):66-69. |
| |
| Authors: | LIU Yang YANG Hai-gang YU Wei CAI Gang XU Wei-tao |
| |
| Affiliation: | 1. Programmable Chip & System Research Laboratory, Institute of Electronics, Chinese Academy of Sciences, Beijng 100190, China; 2. University of Chinese Academy of Sciences, Beijing 100049, China |
| |
| Abstract: | This paper presented a routing algorithm that automatically repaired short-path violations in order to solve short-path problems resulting from holdtime violations in FPGAs. After the execution of VPR timing-driven routing algorithm, the proposed algorithm invoked short-path timing analysis to identify short-path violation connections, and then modified cost function and incrementally rerouted these connections to satisfy short-path constraints. Experimental results demonstrate that the proposed method can repair 94. 7% of short-path violations, while, compared with the VPR, the runtime only increases by 6. 8% on average. |
| |
| Keywords: | FPGA routing short-path violations cost function incrementally reroute |
|
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
