首页 | 本学科首页   官方微博 | 高级检索  
     

一种多线程FPGA时序驱动布线算法
引用本文:于梦薇,刘 洋,尹 韬,杨海钢.一种多线程FPGA时序驱动布线算法[J].太赫兹科学与电子信息学报,2017,15(6):1066-1070.
作者姓名:于梦薇  刘 洋  尹 韬  杨海钢
作者单位:1.Institute of Electronics,Chinese Academy of Sciences,Beijing 100190,China;2. University of the Chinese Academy of Sciences,Beijing 100049,China,Institute of Electronics,Chinese Academy of Sciences,Beijing 100190,China,Institute of Electronics,Chinese Academy of Sciences,Beijing 100190,China and 1.Institute of Electronics,Chinese Academy of Sciences,Beijing 100190,China;2. University of the Chinese Academy of Sciences,Beijing 100049,China
摘    要:随着现场可编程门阵列(FPGA)器件尺寸不断增大,计算机辅助设计(CAD)工具运行时间成为突出的问题。布线是FPGA的CAD流程中最为耗时的一个阶段,一种能有效缩短布线时间的方法就是并行布线。本文提出一种减少FPGA时序驱动布线算法运行时间的多线程方法。该算法首先将信号按照线网的扇出数量进行排序,再将排序后的线网均匀分配到各个线程中,最后并发执行所有的线程。在布线质量没有受到显著影响的前提下,即线长增加2.58%,关键路径延时增加1.78%的情况下,相对于传统通用布局布线工具(VPR)时序驱动布线算法8线程下的加速比为2.46。

关 键 词:现场可编程门阵列(FPGA)  计算机辅助设计(CAD)  并行布线  时序驱动布线  多线程
收稿时间:2016/12/17 0:00:00
修稿时间:2017/1/4 0:00:00

A multithread FPGA timing-driven routing algorithm
YU Mengwei,LIU Yang,YIN Tao and YANG Haigang.A multithread FPGA timing-driven routing algorithm[J].Journal of Terahertz Science and Electronic Information Technology,2017,15(6):1066-1070.
Authors:YU Mengwei  LIU Yang  YIN Tao and YANG Haigang
Abstract:As the size of Field-Programmable Gate Array(FPGA) has surged rapidly, the deteriorative runtime of Computer-Aided Design(CAD) tools has become a major concern. Routing is one of the most time-consuming stage in CAD process, while introducing parallel routing algorithm could be an effective way to cut the runtime. A multithread timing-driven routing technique based on this idea is proposed in this paper. In the parallelization approach, nets are sorted according to their fan-out amount sequence firstly, then the sorted nets are averagely assigned into threads and all the threads are executed concurrently. Using this method, the total wire length and critical path delay are increased by 2.58% and 1.78% respectively, which means the routing quality is well preserved. However, in terms of runtime, it wins approximately 2.46× speedup versus the widely used Versatile Place and Route(VPR) in the case of 8 threads.
Keywords:
点击此处可从《太赫兹科学与电子信息学报》浏览原始摘要信息
点击此处可从《太赫兹科学与电子信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号