Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List

ETD Abstract Container

Abstract Header

Parallelization of Negotiated Congestion Algorithm in FPGA Routing

Abstract Details

2013, MS, University of Cincinnati, Engineering and Applied Science: Computer Engineering.
Routing has been one of the most time-consuming process in FPGA design flow. As technology continues to scale down with feature sizes of devices below 20nm, silicon area are increasing accordingly. In order to meet the demands of larger designs and shorter time-to-market, current EDA tools have to be revised constantly to incorporate new features and algorithms in order to shorten the time spent on critical sections of the design flow, such as placement and routing. Most industrial or academic FPGA routing algorithms today are merely extension of the famous negotiated congestion routing algorithm. The speedup of this algorithm mainly come from approaches within two categories: Optimization of serial version and Parallelization. Our work has presented a new parallelization approach which by splitting up the large nets and assigning different routing region to each core, can better utilize the locality of FPGA routing problem. The algorithm can greatly reduce routing time for large designs. Our experimenting results show a speedup of up to 6x than the base negotiated congestion algorithm. This speedup is on top of the speedup brought by the existing tune-up approaches fro serial version of the algorithm.
Ranganadha Vemuri, Ph.D. (Committee Chair)
Wen Ben Jone, Ph.D. (Committee Member)
Carla Purdy, Ph.D. (Committee Member)
77 p.

Recommended Citations

Citations

  • Zhang, F. (2013). Parallelization of Negotiated Congestion Algorithm in FPGA Routing [Master's thesis, University of Cincinnati]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367936094

    APA Style (7th edition)

  • Zhang, Fan. Parallelization of Negotiated Congestion Algorithm in FPGA Routing. 2013. University of Cincinnati, Master's thesis. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367936094.

    MLA Style (8th edition)

  • Zhang, Fan. "Parallelization of Negotiated Congestion Algorithm in FPGA Routing." Master's thesis, University of Cincinnati, 2013. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1367936094

    Chicago Manual of Style (17th edition)