Fast placement approaches for FPGAs
Author:
Open Access
- 1 April 2002
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Design Automation of Electronic Systems
- Vol. 7 (2) , 284-305
Abstract
Recent trends in FPGA development indicate a strong shift toward design reuse through the use of intellectual property (IP). This design shift has motivated the development of Frontier, a timing-driven FPGA placement system that uses design macroblocks in conjunction 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 intermacro connectivity. Next, FPGA routability and performance metrics are used to evaluate the quality of the initial placement. Finally, if the floorplan is determined to be insufficient from a routability or performance standpoint, a feedback-driven placement perturbation step is employed to achieve a lower cost placement. For a collection of large reconfigurable computing benchmark circuits our timing-driven placement system exhibits a 2.6× speedup in combined place and route time versus commercial FPGA CAD software with improved design performance for most designs. It is shown that floorplanning, placement evaluation, and backend optimization are all necessary to achieve high-performance placement solutions.Keywords
This publication has 9 references indexed in Scilit:
- Timing-driven placement for FPGAs2000
- Trading quality for compile time1999
- A methodology for fast FPGA floorplanning1999
- A fast routability-driven router for FPGAs1998
- Fast module mapping and placement for datapaths in FPGAs1998
- Fast integrated tools for circuit design with FPGAs1998
- Structured design implementation1996
- VLSI cell placement techniquesACM Computing Surveys, 1991
- On a Pin Versus Block Relationship For Partitions of Logic GraphsIEEE Transactions on Computers, 1971