Performance-oriented placement and routing for field-programmable gate arrays

This paper presents a performance-oriented placement and routing tool for field-programmable gate arrays. Using recursive geometric partitioning for simultaneous placement and global routing, and a graph-based strategy for detailed routing, our tool optimizes source-sink pathlengths, channel width and total wire-length. Our results compare favorably with other FPGA layout tools, as measured by the maximum channel width required to place and route a number of industrial benchmarks.

[1]  Jason Cong,et al.  DAG-Map: graph-based FPGA technology mapping for delay optimization , 1992, IEEE Design & Test of Computers.

[2]  Alberto L. Sangiovanni-Vincentelli,et al.  A Detailed Router Based on Incremental Routing Modifications: Mighty , 1987, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

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

[4]  A. El Gamal,et al.  An architecture for electrically configurable gate arrays , 1989 .

[5]  Catherine A. Schevon,et al.  Optimization by simulated annealing: An experimental evaluation , 1984 .

[6]  Kevin Karplus.  Xmap: a technology mapper for table-lookup field-programmable gate arrays , 1991, 28th ACM/IEEE Design Automation Conference.

[7]  Steven Trimberger.  Effects of FPGA Architecture on FPGA Routing , 1995, 32nd Design Automation Conference.

[8]  Jon Frankle,et al.  Iterative and adaptive slack allocation for performance-driven layout and FPGA routing , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[9]  Willy M. C. Sansen,et al.  A Line-Expansion Algorithm for the General Routing Problem with a Guaranteed Solution , 1980, 17th Design Automation Conference.

[10]  Joseph L. Ganley,et al.  An architecture-independent approach to FPGA routing based on multi-weighted graphs , 1994, EURO-DAC '94.

[11]  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.

[12]  James P. Cohoon,et al.  A Parallel VLSI Circuit Layout Methodology , 1993, The Sixth International Conference on VLSI Design.

[13]  Cecilia R. Aragon,et al.  Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning , 1989, Oper. Res..

[14]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[15]  Allen C.-H. Wu Yuh-Sheng Lee.  A Performance and Routability Driven Router for FPGAs Considering Path Delays , 1995, DAC 1995.

[16]  Malgorzata Marek-Sadowska,et al.  Graph based analysis of FPGA routing , 1993, EURO-DAC.

[17]  Jason Cong,et al.  Placement and placement driven technology mapping for FPGA synthesis , 1993, Sixth Annual IEEE International ASIC Conference and Exhibit.

[18]  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.

[19]  A. Kahng,et al.  On optimal interconnections for VLSI , 1994 .

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

[21]  Andrew B. Kahng,et al.  A new class of iterative Steiner tree heuristics with good performance , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[22]  Brian W. Kernighan,et al.  A Procedure for Placement of Standard-Cell VLSI Circuits , 1985, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[23]  Kurt Antreich,et al.  PHIroute: A parallel hierarchical sea-of-gates router , 1994, Proceedings of IEEE International Symposium on Circuits and Systems - ISCAS '94.

[24]  J. L. Ganley.  Geometric interconnection and placement algorithms , 1995 .

[25]  Allen C.-H. Wu,et al.  A Performance and Routability Driven Router for FPGAs Considering Path Delays , 1995, 32nd Design Automation Conference.

[26]  Peter Suaris,et al.  A quadrisection-based combined place and route scheme for standard cells , 1989, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[27]  Jeffrey S. Salowe,et al.  Closing the gap: near-optimal Steiner trees in polynomial time , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..