Graph matching-based algorithms for FPGA segmentation design

Process technology advances will soon make the one-million gate FPGA a reality. A key issue that needs to be solved for the large-scale FPGAs to realize their full potential lies in the design of their segmentation architectures. One-dimensional segmentation designs have been studied to some degree in much of the literature; most of the previously proposed methods are based on stochastic or analytical analysis. In this paper, we address a new direction for studying segmentation architectures. Our method is based on graph-theoretic formulation. We first formulate a net matching problem and present a polynomial-time optimal algorithm to solve the problem. Based on the solution to the problem, we develop an effective and efficient matching-based algorithm for FPGA segmentation designs. Experimental results show that our method significantly outperforms previous work.

[1]  Zvonko G. Vranesic,et al.  Minimizing interconnection delays in array-based FPGAs , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[2]  A. El Gamal,et al.  An architecture for electrically configurable gate arrays , 1988, Proceedings of the IEEE 1988 Custom Integrated Circuits Conference.

[3]  D. F. Wong,et al.  On channel segmentation design for row-based FPGAs , 1992, 1992 IEEE/ACM International Conference on Computer-Aided Design.

[4]  Martin D. F. Wong,et al.  Channel segmentation design for symmetrical FPGAs , 1997, Proceedings International Conference on Computer Design VLSI in Computers and Processors.

[5]  Abbas El Gamal,et al.  Segmented channel routing in nearly as efficient as channel routing (and just as hard) , 1991 .

[6]  Massoud Pedram,et al.  Design and analysis of segmented routing channels for row-based FPGA's , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

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

[8]  M. Mehendale,et al.  Optimization Of Channel Segmentation For Channelled Architecture FPGAs , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[9]  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).

[10]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[11]  Dwight D. Hill,et al.  Architectural and physical design challenges for one-million gate FPGAs and beyond , 1997, FPGA '97.