Fast FPGA placement using space-filling curve

In this paper, we propose a placement method for island-style FPGAs, based on recursive bi-partitioning followed by application of space-filling curves. Experimental results of our method show 55% improvement in cost, when compared to random initial placement of the popular tool VPR. The solutions thus obtained require 44.5% fewer moves during final iterative refinement by ultra-low temperature simulated annealing, whereas the quality of solution is on the average 0.1% better. This establishes the utility of the method for fast reconfiguration of FPGA based co-processors.

[1]  Carl Sechen,et al.  VLSI Placement and Global Routing Using Simulated Annealing , 1988 .

[2]  Scott Hauck,et al.  Runtime and quality tradeoffs in FPGA placement and routing , 2001, FPGA '01.

[3]  Abhishek Ranjan,et al.  Multi-Million Gate FPGA Physical Design Challenges , 2003, ICCAD.

[4]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[5]  Lawrence T. Pileggi,et al.  Architecture-aware FPGA placement using metric embedding , 2006, 2006 43rd ACM/IEEE Design Automation Conference.

[6]  Román Hermida,et al.  Annealing placement by thermodynamic combinatorial optimization , 2004, TODE.

[7]  Mohammed A. S. Khalid,et al.  QPF: efficient quadratic placement for FPGAs , 2005, International Conference on Field Programmable Logic and Applications, 2005..

[8]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9]  Santosh S. Vempala.  Random projection: a new approach to VLSI layout , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[10]  Vaughn Betz,et al.  VPR: A new packing, placement and routing tool for FPGA research , 1997, FPL.

[11]  Shashi Shekhar,et al.  Multilevel hypergraph partitioning: applications in VLSI domain , 1999, IEEE Trans. Very Large Scale Integr. Syst..

[12]  Dinesh Bhatia,et al.  Tabu Search: Ultra-Fast Placement for FPGAs , 1999, FPL.

[13]  Jens Vygen,et al.  New theoretical results on quadratic placement , 2007, Integr..

[14]  Michael Lindenbaum,et al.  On the metric properties of discrete space-filling curves , 1996, IEEE Trans. Image Process..

[15]  S. Sahni,et al.  Optional linear arrangement of circuit components , 1987 .

[16]  Milton Abramowitz,et al.  Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .

[17]  Jason Cong,et al.  FPGA Design Automation: A Survey , 2006, Found. Trends Electron. Des. Autom..

[18]  H. Sagan.  Space-filling curves , 1994 .

[19]  Philip M. Morse,et al.  Optimal Linear Ordering of Information Items , 1972, Oper. Res..

[20]  D. F. Wong,et al.  Simulated Annealing for VLSI Design , 1988 .

[21]  Andrew B. Kahng,et al.  Recent directions in netlist partitioning: a survey , 1995, Integr..

[22]  Ankur Srivastava,et al.  Design and analysis of physical design algorithms , 2001, ISPD '01.

[23]  James R. Lee,et al.  An improved approximation ratio for the minimum linear arrangement problem , 2007, Inf. Process. Lett..

[24]  R. M. Mattheyses,et al.  A Linear-Time Heuristic for Improving Network Partitions , 1982, 19th Design Automation Conference.

[25]  Subhas C. Nandy,et al.  Efficient algorithms for single- and two-layer linear placement of parallel graphs , 1997 .

[26]  D. Hilbert.  Über die stetige Abbildung einer Linie auf ein Flächenstück , 1935 .

[27]  Derick Wood,et al.  Theory of computation , 1986 .

[28]  Christoph Schierz,et al.  Algorithm 781: generating Hilbert's space-filling curve by recursion , 1998, TOMS.

[29]  Satish Rao,et al.  New approximation techniques for some ordering problems , 1998, SODA '98.

[30]  G. Peano.  Sur une courbe, qui remplit toute une aire plane , 1890 .

[31]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[32]  Joseph Naor,et al.  Divide-and-conquer approximation algorithms via spreading metrics , 2000, JACM.

[33]  Desh Ranjan,et al.  Space Filling Curves and Their Use in the Design of Geometric Data Structures , 1995, LATIN.

[34]  Yossi Shiloach,et al.  A Minimum Linear Arrangement Algorithm for Undirected Trees , 1979, SIAM J. Comput..

[35]  Pinaki Mazumder,et al.  VLSI cell placement techniques , 1991, CSUR.

[36]  K. Bazargan,et al.  Fast timing-driven partitioning-based placement for island style FPGAs , 2003, Proceedings 2003. Design Automation Conference (IEEE Cat. No.03CH37451).

[37]  Huang,et al.  AN EFFICIENT GENERAL COOLING SCHEDULE FOR SIMULATED ANNEALING , 1986 .

[38]  Susmita Sur-Kolay,et al.  Fast FPGA Placement using Space-filling Curve , 2005, FPL.