A New Global Routing Algorithm For FPGAs

As in traditional ASIC technologies, FPGA routing usually consists of two steps: global routing and detailed routing. Unlike existing FPGA detailed routers, which can take full advantage of the special structures of the programmable routing resources, FPGA global routing algorithms still greatly resemble their counterparts in the traditional ASIC technologies. In particular, the routing congestion information of a switch block essentially is still measured by the numbers of available rows and columns in the switch block. Since the internal architecture of a switch block decides what can route through the block, the traditional measure of routing capacity is no longer accurate. In this paper, we present an accurate measure of switch block routing capacity. Our new measure considers the exact positions of the switches inside a switch block. Experiments with a global router based on these ideas show an average improvement of 38% in the channel width required to route some benchmark circuits using a popular switch block, compared with an algorithm based on the traditional methods for congestion control.

[1]  Yao-Wen Chang,et al.  Switch module design with application to two-dimensional segmentation design , 1993, ICCAD.

[2]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[3]  Yao-Wen Chang,et al.  Switch module design with application to two-dimensional segmentation design , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[4]  Dwight D. Hill,et al.  Routable technology mapping for LUT FPGAs , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[5]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[6]  Jonathan Rose,et al.  A detailed router for field-programmable gate arrays , 1990, 1990 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  S. Muthukrishnan,et al.  Algorithms for a switch module routing problem , 1994, EURO-DAC '94.

[8]  Martin D. F. Wong,et al.  Algorithms for FPGA Switch Module Routability Analysis , 1994 .

[9]  Steven Trimberger,et al.  Placement-based partitioning for lookup-table-based FPGAs , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.