Frontier: A Fast Placement System for FPGAs

In this paper we describe Frontier, an FPGA placement system that uses design macro-blocks in conjuction with a series of placement algorithms to achieve highly-routable and high-performance layouts quickly. In the first stage of design placement, a macro-based floorplanner is used to quickly identify an initial layout based on inter-macro connectivity. Next, an FPGA routability metric, previously described in [10], is used to evaluate the quality of the initial placement. Finally, if the floorplan is determined to be unroutable, a feedback-driven placement perturbation step is employed to achieve a lower cost placement. For a collection of large reconfigurable computing benchmark circuits our placement system exhibits a 4 × speedup in combined place and route time versus commercial FPGA CAD software with improved design performance for most designs. It is shown that floorplanning, routability evaluation, and back-end optimization are all necessary to achieve efficient placement solutions.

[1]  Takashi Kambe,et al.  Hybrid floorplanning based on partial clustering and module restructuring , 1996, Proceedings of International Conference on Computer Aided Design.

[2]  Vaughn Betz,et al.  A fast routability-driven router for FPGAs , 1998, FPGA '98.

[3]  Jonathan Rose,et al.  Trading quality for compile time: ultra-fast placement for FPGAs , 1999, FPGA '99.

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

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

[6]  Dinesh Bhatia,et al.  A methodology for fast FPGA floorplanning , 1999, FPGA '99.

[7]  Dinesh Bhatia,et al.  Fast Floorplanning for FPGAs , 1998, FPL.

[8]  Victor Lee,et al.  The RAW benchmark suite: computation structures for general purpose computing , 1997, Proceedings. The 5th Annual IEEE Symposium on Field-Programmable Custom Computing Machines Cat. No.97TB100186).

[9]  Russell Tessier,et al.  Fast place and route approaches for fpgas , 1999 .

[10]  Andreas Koch.  Structured Design Implementation - A Strategy for Implementing Regular Datapaths on FPGAs , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[11]  Stephan W. Gehring,et al.  Fast integrated tools for circuit design with FPGAs , 1998, FPGA '98.

[12]  John Wawrzynek,et al.  Fast module mapping and placement for datapaths in FPGAs , 1998, FPGA '98.

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