Light Search Algorithm for FPGA Routing Path

被引：0
|
作者：
Wang D. [1 ]
Zhang L. [1 ]
Lu X. [2 ]
机构：
[1] School of Information Science & Technology, Northwest University, Xi’an
[2] School of Computer Science and Technology, Xidian University, Xi’an
来源：
Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics | 2023年 / 35卷 / 05期
关键词：
large scale circuit; light search; programmable gate array; routing algorithm; shortest path;
D O I：
10.3724/SP.J.1089.2023.19420
中图分类号：
学科分类号：
摘要：
In order to address the long runtime issue of FPGA routing, a light search algorithm for FPGA routing path is presented. By predicting optimal nodes, the proposed algorithm computes and analyzes only the optimal nodes when searching for the shortest route, which improves the search efficiency. When the light search fails to find the sink, a new light search process is then started from the global optimal node, so as to improve the global search ability. In the search of global best nodes, only the suboptimal nodes that are promising to be on the lowest cost path are further analyzed which reduces the useless work. The proposed algorithm and VPR 8.0 are compared in terms of run-time and quality of results by using the VTR standard benchmark. Experimental results show that compared to the routing path searching algorithm in VPR 8.0, the proposed algorithm reduces the number of explored nodes by 41.8%, leading to a 31.3% runtime reduction. Meanwhile, the quality of results is basically unaffected. © 2023 Institute of Computing Technology. All rights reserved.
引用
收藏
页码：789 / 795
页数：6
相关论文
共 15 条
  • [1] Murray K E, Whitty S, Liu S Y, Et al., Timing-driven titan: enabling large benchmarks and exploring the gap between academic and commercial CAD, ACM Transactions on Reconfigurable Technology and Systems, 8, 2, (2015)
  • [2] Betz V, Rose J, Marquardt A., Architecture and CAD for deep-submicron FPGAs, (1999)
  • [3] McMurchie L, Ebeling C., PathFinder: a negotiation-based performance-driven router for FPGAs, Proceedings of the 3rd International ACM Symposium on Field-Programmable Gate Arrays, pp. 111-117, (1995)
  • [4] Murray K E, Petelin O, Zhong S, Et al., VTR 8: high-performance CAD and customizable FPGA architecture modelling, ACM Transactions on Reconfigurable Technology and Systems, 13, 2, (2020)
  • [5] Liu Yang, Yang Haigang, Huang Zhihong, Et al., A fast FPGA routing algorithm based on repeated search avoidance, Journal of Computer-Aided Design & Computer Graphics, 26, 6, pp. 1015-1024, (2014)
  • [6] Liu Yang, Yang Haigang, Yu Wei, Et al., An FPGA timing routing algorithm based on PathFinder and rip-up and retry approach, Journal of Computer-Aided Design & Computer Graphics, 26, 1, pp. 138-145, (2014)
  • [7] Vahid F, Stitt G, Lysecky R., Warp processing: dynamic translation of binaries to FPGA circuits, Computer, 41, 7, pp. 40-46, (2008)
  • [8] Coole J, Stitt G., BPR: fast FPGA placement and routing using macroblocks, Proceedings of the 8th IEEE/ACM/IFIP International Conference on Hardware/Software Codesign and System Synthesis, pp. 275-284, (2012)
  • [9] Shen M H, Luo G J, Xiao N., Combining static and dynamic load balance in parallel routing for FPGAs, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 40, 9, pp. 1850-1863, (2021)
  • [10] Wang D K, Duan Z H, Tian C, Et al., ParRA: a shared memory parallel FPGA router using hybrid partitioning approach, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 39, 4, pp. 830-842, (2020)
12