The effect of post-layout pin permutation on timing

In this paper we study the effect of post-layout pin permutation of designs for FPGA devices with non-uniform cell delays. We present a simple, but timing optimal, pin permutation scheme, and report the results of applying the scheme on a set of public logic synthesis benchmark designs that were synthesized and placed by state-of-the-art commercial FPGA design tools configured to maximum optimization level. Despite the preceding optimizations, we still observed an average timing improvement of 3.7%. This demonstrates the importance of fully utilizing non-uniform cell delays during design optimizations for modern FPGA devices and the still presenting potential of improvement.

[1]  Nan-Chi Chou,et al.  Incremental physical resynthesis for timing optimization , 2004, FPGA '04.

[2]  Jason Cong,et al.  Combinational logic synthesis for LUT based field programmable gate arrays , 1996, TODE.

[3]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[4]  Robert E. Tarjan,et al.  Fibonacci heaps and their uses in improved network optimization algorithms , 1984, JACM.

[5]  Jason Cong,et al.  Technology mapping for FPGAs with nonuniform pin delays and fast interconnections , 1999, DAC '99.

[6]  Jason Cong,et al.  Boolean matching for LUT-based logic blocks with applications toarchitecture evaluation and technology mapping , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[7]  Jason Cong,et al.  FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[8]  Jason Cong,et al.  Beyond the combinatorial limit in depth minimization for LUT-based FPGA designs , 1993, ICCAD.

[9]  Sze-Tsen Hu ON THE DECOMPOSITION OF SWITCHING FUNCTIONS , 1961 .

[10]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

[11]  Klaus Eckl,et al.  An implicit algorithm for support minimization during functional decomposition , 1996, Proceedings ED&TC European Design and Test Conference.

[12]  Robert E. Tarjan,et al.  Almost-optimum speed-ups of algorithms for bipartite matching and related problems , 1988, STOC '88.

[13]  Jason Cong,et al.  Placement-driven technology mapping for LUT-based FPGAs , 2003, FPGA '03.

[14]  Robert E. Tarjan,et al.  Faster Scaling Algorithms for Network Problems , 1989, SIAM J. Comput..