Routing on field-programmable switch matrices

In this paper, we address the problem of routing nets on field programmable gate arrays (FPGAs) interconnected by a switch matrix. We extend the switch matrix architecture proposed by Zhu et al. (1993) to route nets between FPGA chips in a multi-FPGA system. Given a limited number of routing resources in the form of programmable connection points within a two-dimensional switch matrix, this problem examines the issue of how to route a given net traffic through the switch matrix structure. First, we define the problem as a general undirected graph in which each vertex has one single color among six possible colors and formulate it as a constraint satisfaction problem. This is further modeled as a 0-1 multidimensional knapsack problem for which a fast approximate solution is applied. Experimental results show that the accuracy of our proposed heuristic is quite high for moderately large switch matrices.

[1]  Y. Toyoda.  A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems , 1975 .

[2]  William S. Carter,et al.  Third-generation architecture boosts speed and density of field-programmable gate arrays , 1990, IEEE Proceedings of the Custom Integrated Circuits Conference.

[3]  S. Knapp,et al.  Field configurable system-on-chip device architecture , 2000, Proceedings of the IEEE 2000 Custom Integrated Circuits Conference (Cat. No.00CH37044).

[4]  Srinivas Devadas,et al.  Optimal layout via Boolean satisfiability , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[5]  Ranga Vemuri,et al.  Interconnect Synthesis for Reconfigurable Multi-FPGA Architectures , 1999, IPPS/SPDP Workshops.

[6]  Steven J. E. Wilton,et al.  Programmable logic IP cores in SoC design: opportunities and challenges , 2001, Proceedings of the IEEE 2001 Custom Integrated Circuits Conference (Cat. No.01CH37169).

[7]  Luca Benini,et al.  Networks on Chips : A New SoC Paradigm , 2022 .

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

[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]  S. Senju,et al.  An Approach to Linear Programming with 0--1 Variables , 1968 .

[11]  L. Cooke,et al.  An MPGA Compatible FPGA Architecture , 1992, 1992 Proceedings of the IEEE Custom Integrated Circuits Conference.

[12]  A. Mohsen,et al.  A novel reprogrammable interconnect architecture with decoded RAM storage , 1994, Proceedings of IEEE Custom Integrated Circuits Conference - CICC '94.

[13]  Rob A. Rutenbar,et al.  FPGA routing and routability estimation via Boolean satisfiability , 1998, IEEE Trans. Very Large Scale Integr. Syst..

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

[15]  Chak-Kuen Wong,et al.  Design and analysis of FPGA/FPIC switch modules , 1995, Proceedings of ICCD '95 International Conference on Computer Design. VLSI in Computers and Processors.