New performance-driven FPGA routing algorithms
- 1 December 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
- Vol. 15 (12) , 1505-1517
- https://doi.org/10.1109/43.552083
Abstract
Motivated by the goal of increasing the performance of FPGA-based designs, we propose new Steiner and arborescence FPGA routing algorithms. Our Steiner tree constructions significantly outperform the best known ones and have provably good performance bounds. Our arborescence heuristics produce routing solutions with optimal source-sink pathlengths, and with wirelength on par with the best existing Steiner tree heuristics. We have incorporated these algorithms into an actual FPGA router, which routed a number of industrial circuits using channel width considerably smaller than is achievable by previous routers. Our routing results for both the 3000 and 4000-series Xilinx parts are currently the best known in the Literature.Keywords
This publication has 27 references indexed in Scilit:
- Routable technology mapping for LUT FPGAsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Routing for symmetric FPGAs and FPICsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An efficient router for 2-D field programmable gate arrayPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A timing-driven global router for custom chip designPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Near-optimal critical sink routing tree constructionsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1995
- Field-Programmable Gate Array TechnologyPublished by Springer Nature ,1994
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- A faster approximation algorithm for the steiner tree problem in graphsInformation Processing Letters, 1993
- The rectilinear steiner arborescence problemAlgorithmica, 1992
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988