RippleFPGA: Routability-Driven Simultaneous Packing and Placement for Modern FPGAs

نویسندگان

  • Gengjie Chen
  • Chak-Wa Pui
  • Wing-Kai Chow
  • Ka-Chun Lam
  • Jian Kuang
  • Evangeline F. Y. Young
  • Bei Yu
چکیده

As a good trade-off between CPU and ASIC, FPGA is becoming more widely used in both industry and academia. The increasing complexity and scale of modern FPGA, however, impose great challenges on the FPGA placement and packing problem. In this paper, we propose RippleFPGA to solve the packing and placement simultaneously through a set of novel techniques, such as (i) smooth stair-step flow, (ii) implicit packing similar to ASIC legalization, and (iii) two-level detailed placement. To enable the flow, a generic, efficient and false-alarm-free legality checking method is also proposed. Besides, due to the insufficiency of ASIC-like congestion alleviation methods, some FPGA-routing-architecture-aware optimization techniques are proposed to improve the routability. When evaluated by ISPD 2016 Contest benchmarks, RippleFPGA has 5.1% better routed wirelength and 5.5× speedup compared to all the state-of-the-art FPGA placers.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Routability-Driven Packing: Metrics And Algorithms For Cluster-Based FPGAs

Most of an FPGA s area and delay are due to routing Considering routability at earlier steps of the CAD ow would both yield better quality and faster design process In this paper we discuss the metrics that a ect routability in packing logic into clusters We are presenting a routability driven clustering method for cluster based FPGAs Our method packs LUTs into logic clusters while incorporatin...

متن کامل

RPack: Routability-driven Packing Algorithm for Cluster-based FPGAs

Routing tools consume a signiicant portion of the total design time. Considering routability at earlier steps of the CAD ow would both yield better quality and faster design process. In this paper we are presenting a routability-driven clustering method for cluster-based FPGAs. Our method packs LUTs into logic clusters while incorporating routability metrics into a cost function. The objective ...

متن کامل

UTPlaceF 2.0: A High-Performance Clock-Aware FPGA Placement Engine

Modern field-programmable gate array (FPGA) devices contain complex clock architectures on top of configurable logics. Unlike application specific integrated circuits (ASICs), the physical structure of clock networks in an FPGA is pre-manufactured and cannot be adjusted to different applications. Furthermore, clock routing resources are typically limited for high-utilization designs. Consequent...

متن کامل

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, previou...

متن کامل

Routability Prediction of Network Topologies in FPGAs

A fundamental difference between ASICs and FPGAs is that the wires in ASICs are designed to match the requirements of a particular design. Conversely, in an FPGA, area is fixed and routing resources exist whether or not they are used. Modern FPGAs have the logic and routing resources to implement networks of multiprocessor systems, and system-level interconnection becomes a key element of the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017