A Router for Symmetrical FPGAs Based on Exact Routing Density Evaluation

This paper presents a new performance and routability driven routing algorithm for symmetrical array based field-programmable gate arrays (FPGAs). A key contribution of our work is to overcome one essential limitation of the previous routing algorithms: inaccurate estimations of routing density which were too general for symmetrical FPGAs. To this end, we derive an exact routing density calculation that is based on a precise analysis of the structure (switch block) of symmetrical FPGAs, and utilize it consistently in global and detailed routings. With an introduction of the proposed accurate routing metrics, we design a new routing algorithm called a cost-effective net-decomposition based routing which is fast, and yet produces remarkable routing results in terms of both routability and path/net delays. We performed an extensive experiment to show the effectiveness of our algorithm based on the proposed cost metrics.

[1]  Guy Lemieux,et al.  On two-step routing for FPGAS , 1997, ISPD '97.

[2]  Malgorzata Marek-Sadowska,et al.  Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing , 1995, 32nd Design Automation Conference.

[3]  C. L. Liu,et al.  Routing in a New 2-Dimensional FPGA/FPIC Routing Architecture , 1994, 31st Design Automation Conference.

[4]  Guy G.F. Lemieux.  A Detailed Routing Algorithm for Allocating Wire Segments in Field-Programmable Gate Arrays , 1998 .

[5]  Forbes D. Lewis,et al.  A Negative Reinforcement Method for PGA Routing , 1993, 30th ACM/IEEE Design Automation Conference.

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

[7]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[8]  K. Takahashi,et al.  A congestion-driven placement improvement algorithm for large scale sea-of-gates arrays , 1997, Proceedings of CICC 97 - Custom Integrated Circuits Conference.

[9]  Stephen D. Brown,et al.  Flexibility of interconnection structures for field-programmable gate arrays , 1991 .

[10]  Marek Kubale,et al.  A generalized implicit enumeration algorithm for graph coloring , 1985, CACM.

[11]  Allen Van Gelder,et al.  Computer Algorithms: Introduction to Design and Analysis , 1978 .

[12]  Malgorzata Marek-Sadowska,et al.  An efficient router for 2-D field programmable gate array , 1994, Proceedings of European Design and Test Conference EDAC-ETC-EUROASIC.

[13]  Joseph L. Ganley,et al.  Performance-oriented placement and routing for field-programmable gate arrays , 1995, Proceedings of EURO-DAC. European Design Automation Conference.

[14]  Chak-Kuen Wong,et al.  Routing for symmetric FPGAs and FPICs , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[15]  Sara Baase,et al.  Computer algorithms - introduction to design and analysis (2 ed.) , 1988 .

[16]  C. Liu,et al.  Routing for Symmetric FPGA's and FPIC's , 1997 .

[17]  Allen C.-H. Wu,et al.  A performance and routability-driven router for FPGAs considering path delays , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[18]  Youn-Long Lin,et al.  TRACER-fpga: a router for RAM-based FPGA's , 1995, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[19]  Gabriel Robins,et al.  New Performance-Driven FPGA Routing Algorithms , 1996, 32nd Design Automation Conference.

[20]  Vaughn Betz,et al.  VPR: A new packing, placement and routing tool for FPGA research , 1997, FPL.