A multithread FPGA timing-driven routing algorithm
Author:
Affiliation:

Funding:

Ethical statement:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
    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.

    Reference
    Related
    Cited by
Get Citation

于梦薇,刘 洋,尹 韬,杨海钢.一种多线程FPGA时序驱动布线算法[J]. Journal of Terahertz Science and Electronic Information Technology ,2017,15(6):1066~1070

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
History
  • Received:December 17,2016
  • Revised:January 04,2017
  • Adopted:
  • Online: January 03,2018
  • Published: