层次式FPGA快速可布性布线算法

提出了一种针对层次式结构FPGA的快速拆线重布布线算法.利用历史拆线信息衡量拆线区域的可布性、可重布性及拆线影响力,形成独特的资源竞争解决机制;在禁忌搜索框架下选取禁忌拆线点、拆线路径与拆线线网,并在禁忌策略的指导下解决资源冲突,提高拆线有效性与速度.文中算法分为初始布线阶段与拆线重布2个阶段.在布线过程中,针对层次式结构引入简洁实用的布线线序.实验结果表明,该算法中的拆线机制可以有效地减少拆线数目,显著提高了运行速度.

A Fast Routability-Driven Router for Hierarchical FPGA

By using historical information of congestions to evaluate the routability and reroutability in congestion area and the influence of rip-up,the algorithm proposes another mechanism to resolve resource competition problem.Tabu nodes,rip-up nets and reroute paths are selected under the framework of tabu search,and relative strategies are applied to implement the mechanism,which simultaneously enhance the speed and the effectiveness of ripping up.The algorithm consists of two stages:initial routing process,rip...