scispace - formally typeset
Journal ArticleDOI

Fast placement approaches for FPGAs

Reads0
Chats0
TLDR
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, shows that floorplanning, placement evaluation, and backend optimization are all necessary to achieve high- performance placement solutions.
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.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Scott Hauck, +1 more
TL;DR: This book is intended as an introduction to the entire range of issues important to reconfigurable computing, using FPGAs as the context, or "computing vehicles" to implement this powerful technology.
Book

Reconfigurable Computing: Accelerating Computation with Field-Programmable Gate Arrays

Maya Gokhale, +1 more
TL;DR: A one-of-a-kind survey of the field of Reconfigurable Computing gives a comprehensive introduction to a discipline that offers a 10X-100X acceleration of algorithms over microprocessors.
Book

FPGA Design Automation: A Survey

TL;DR: All major steps in FPGA design flow which includes: routing and placement, circuit clustering, technology mapping and architecture-specific optimization, physical synthesis, RT-level and behavior-level synthesis, and power optimization are covered.
Proceedings ArticleDOI

HMFlow: Accelerating FPGA Compilation with Hard Macros for Rapid Prototyping

TL;DR: This work presents results from creating a new FPGA design flow based on hard macros called HMF low, designed for rapid prototyping that has shown speedups of 10-50X over the fastest configuration of the Xilinx tools.
Proceedings ArticleDOI

FlexGrip: A soft GPGPU for FPGAs

TL;DR: The implementation of FlexGrip is described, a soft GPGPU architecture which has been optimized for FPGA implementation which supports direct CUDA compilation to a binary which is executable on the F PGPU without hardware recompilation.
References
More filters
Book ChapterDOI

VPR: A new packing, placement and routing tool for FPGA research

TL;DR: In terms of minimizing routing area, VPR outperforms all published FPGA place and route tools to which the authors can compare and presents placement and routing results on a new set of circuits more typical of today's industrial designs.
Journal ArticleDOI

On a Pin Versus Block Relationship For Partitions of Logic Graphs

TL;DR: Partitions of the set of blocks of a computer logic graph, also called a block graph, into subsets called modules demonstrate that a two-region relationship exists between P, the average number of pins per module, and B, theaverage number of blocks per module.
BookDOI

Field-Programmable Gate Array Technology

TL;DR: The purpose of this chapter was to discuss the design and implementation of SRAM Programmable FPGAs, as well as some of the techniques used in the development of Erasable Programmable Logic Devices.
Journal ArticleDOI

VLSI cell placement techniques

TL;DR: Five major algorithms for placement are discussed: simulated annealing, force-directed placement, min-cut placement, placement by numerical optimization, and evolution-based placement, which is derived from biological phenomena.
Proceedings ArticleDOI

Timing-driven placement for FPGAs

TL;DR: A new Simulated Annealing-based timing-driven placement algorithm for FPGAs is introduced that employs a novel method of determining source-sink connection delays during placement and introduces a new cost function that trades off between wire-use and critical path delay, resulting in significant reductions incritical path delay without significant increases in wire- use.