Orthogonal Greedy Coupling - A New Optimization Approach to 2-D FPGA Routing

We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a different optimization target are designed. By applying one algorithm first and then switching to the other when the first one approaches its decaying stage, the undesired effect can be significantly reduced and thus better results are produced. On the tested MCNC and industry benchmarks, in addition to our very low segment consumption the total number of tracks used by our scheme is 37% less than a published conventional maze router and 22% less than the best known 2-step global/detailed router [4,5]. Our results show that complicated multi-objective problems could be effectively attacked by coupling low complexity algorithms that traverse the solution space in orthogonal directions. This idea is applicable on both algorithmic and architectural optimization approaches [7].

[1]  Douglas Chang,et al.  On The Np-completeness Of Regular 2-d Fpga Routing Architectures And A Novel Solution , 1994, IEEE/ACM International Conference on Computer-Aided Design.

[2]  Jeffrey D. Ullman,et al.  Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..

[3]  Douglas Chang,et al.  On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution , 1994, ICCAD.

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

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

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

[7]  Malgorzata Marek-Sadowska,et al.  On two-dimensional fpga routing: theoretical analysis and novel effective solutions , 1994 .

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

[9]  A. Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC '71.

[10]  Mikael Palczewski.  Plane parallel A* maze router and its application to FPGAs , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[11]  Tatsuo Ohtsuki,et al.  One-dimensional logic gate assignment and interval graphs , 1979, COMPSAC.

[12]  Malgorzata Marek-Sadowska,et al.  Graph based analysis of 2-D FPGA routing , 1996, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Akihiro Hashimoto,et al.  Wire routing by optimizing channel assignment within large apertures , 1971, DAC.

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

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