期刊文献+

基于VPR的FPGA布局算法时延改进 被引量:1

Time Delay Improvement of FPGA Placement Algorithm Based on VPR
下载PDF
导出
摘要 基于模拟退火的现场可编程门阵列(FPGA)布局算法在计算关键度时存在一定的偏差。为此,提出一种FPGA布局时延改进算法。利用不同的模拟退火温度和交换接收率,以及前后2次布局的时延代价差,对FPGA布局的时延代价进行补偿。通过增加时延补偿模块来调整布局的代价函数,达到重新寻找布局过程中被遗弃的较优解的目的。实验结果表明,在MCNC基准电路上使用改进算法,布局的时延代价和线网代价分别比改进前的算法减少19.2%和0.5%。此外,电路的关键路径时延也得到了不同程度的改善,使得布局质量在各个方面都明显优于优化前的通用布局布线算法。 There is some degree of error during the calculation of the critical in Field Programmable Gate Array ( FPGA) placement algorithm based on simulated annealing. In order to solve this problem, a new FPGA placement algorithm is proposed. The improved algorithm can find a better placement that is discarded previously by adding a delay compensation module which leverages the information such as the different annealing temperature, the every exchange success rate under different temperatures,and the difference of delay cost between two successive placements. The new algorithm is implemented and tested on several MCNC benchmark circuits. Experimental results show that,the delay cost and the wire cost are reduced by 19. 2% and 0. 5% . Besides,the critical path delay of the circuits is improved at different levels,thus making the quality of placement significantly higher than the original Versatile Place and Route ( VPR ) placement algorithm.
出处 《计算机工程》 CAS CSCD 2014年第12期302-305,共4页 Computer Engineering
基金 国家自然科学基金资助项目(61173037) 湖南大学青年教师成长计划基金资助项目
关键词 现场可编程门阵列 模拟退火算法 关键路径时延 关键度 布局 通用布局布线算法 Field Programmable Gate Array(FPGA) simulated annealing algorithm critical path time delay critical degree placement Versatile Place and Route (VPR) algorithm
  • 相关文献

参考文献11

  • 1Betz V,Rose J,Marquardt A.Architecture and CAD for Deep-submicron FPGAs[M].[S.l.]:Kluwer Academic Publishers,1999.
  • 2Ludwin A,Betz V,Padalia K.High-quality Deterministic Parallel Placement for FPGAs on Commodity Hardware[C]//Proceedings of the16th International Symposium on Field Programmable Gate Arrays.New York,USA:[s.n.],2008:14-23.
  • 3Chen Gang,Cong J.Simultaneous Placement with Clustering and Duplication[J].ACM Transactions on Design Automation of Electronic Systems,2006,11(3):740-772.
  • 4Eguro K,Hauck S,Sharma A.Architecture-adaptive Range Limit Windowing for Simulated Annealing FPGA Placement[C]//Proceedings of the42nd Annual Conference on Design Automation.New York,USA:[s.n.],2005:439-444.
  • 5Betz V,Rose J.VPR:A New Packing,Placement and Routing Tool for FPGA Research[C]//Proceedings of International Workshop on Field Programmable Logic and Applications.Berlin,Germany:Springer,1997:213-222.
  • 6Khalid M.QPF:An Efficient Quadratic Placement for FPGAs[C]//Proceedings of IEEE International Conference on Field Programmable Logic and Application.[S.l.]:IEEE Press,2005:555-558.
  • 7Kirkpatrick S.Optimization by Simulated Annealing:Quantitative Studies[J].Journal of Statistical Physics,1984,34(5):975-986.
  • 8Luu J,Kuon I,Jamieson P.VPR5.0:FPGA CAD and Architecture Exploration Tools with Single-driver Routing Heterogeneity and Process Scaling[C]//Proceedings of International Symposium on Field Programmable Gate Arrays.New York,USA:[s.n.],2009:133-142.
  • 9Eguro K,Hauck S.Enhancing Timing-driven FPGA Placement for Pipelined Netlists[C]//Proceedings of Design Automation Conference.Anaheim,USA:[s.n.],2008:34-37.
  • 10李鹏,兰巨龙,李立春.统一关键路径时延为基准FPGA模拟退火布局算法[J].计算机辅助设计与图形学学报,2011,23(3):521-526. 被引量:4

二级参考文献21

  • 1徐新民,王倩,严晓浪.FPGA布线通道分布对面积效率的影响研究[J].电子与信息学报,2006,28(10):1959-1962. 被引量:2
  • 2倪刚,来金梅,童家榕.一种基于图模式匹配的逻辑单元映射算法[J].计算机辅助设计与图形学学报,2006,18(12):1850-1854. 被引量:4
  • 3胡云,王伶俐,唐璞山,童家榕.基于布通率的FPGA装箱算法[J].计算机辅助设计与图形学学报,2007,19(1):108-113. 被引量:5
  • 4张相芬,张洪梅,田蔚风.基于模拟回火退火的DT-MR图像平滑和估计[J].上海交通大学学报,2007,41(4):654-657. 被引量:1
  • 5Pandit A,Easwaran L,Akoglu A.Concurrent timing based and routability driven depopulation technique for FPGA packing[C]//Proceedings of International Conference on Electrical and Computer Engineering Technology.Piscataway:IEEE Computer Society Press,2008:325-328.
  • 6Betz V,Rose J.VPR:a new packing,placement and routing tool for FPGA research[C]//Proceedings of the 7th International Workshop on Field-Programmable Logic and Applications.London:Springer,1997:213-222.
  • 7Eguro K,Hauck S.Simultaneous retiming and placement for pipelined netlists[C]//Proceedings of the 16th International Symposium on Filed-Programmable Custom Computing Machines.Los Alamitos:IEEE Computer Society Press,2008:139-148.
  • 8Eguro K,Hauck S.Enhancing timing-driven FPGA placement for pipelined netlists[C]//Proceedings of the 45th Annual Design Automation Conference.New York:ACM Press,2008:34-37.
  • 9Li S,Ebeling C.QuickRoute:a fast routing algorithm for pipelined architectures[C]//Proceedings of IEEE International Conference on Field-Programmable Technology.Los Alamitos:IEEE Computer Society Press,2004:73-80.
  • 10Eguro K,Hauck S.Armada:timing-driven pipeline-aware routing for FPGAs[C]//Proceedings of the 14th International Symposium on Filed Programmable Gate Arrays.New York:ACM Press,2006:169-178.

共引文献3

同被引文献1

引证文献1

二级引证文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部