NDLI: Runtime and quality tradeoffs in FPGA placement and routing

Please wait, while we are loading the content...

Timing-driven placement for hierarchical programmable logic devices

LRoute: a delay minimal router for hierarchical CPLDs

A crosstalk-aware timing-driven router for FPGAs

Runtime and quality tradeoffs in FPGA placement and routing

Performance-driven mapping for CPLD architectures

Simultaneous logic decomposition with technology mapping in FPGA designs

Using sparse crossbars within LUT

Detailed routing architectures for embedded programmable logic IP cores

Mixing buffers and pass transistors in FPGA routing architectures

Reprogrammable network packet processing on the field programmable port extender (FPX)

Fast implementations of secret-key block ciphers using mixed inner- and outer-round pipelining

Algorithmic transformations in the implementation of K- means clustering on reconfigurable hardware

Is marriage in the cards for programmable logic, microprocessors and ASICs?

Attacking the semantic gap between application programming languages and configurable hardware

Matching and searching analysis for parallel hardware implementation on FPGAs

Evaluation of the streams-C C-to-FPGA compiler: an applications perspective

The effect of reconfigurable units in superscalar processors

Interconnect pipelining in a throughput-intensive FPGA architecture

The case for registered routing switches in field programmable gate arrays

Configuration compression for FPGA-based embedded systems

A memory coherence technique for online transient error recovery of FPGA configurations

Run-Time defect tolerance using JBits

A pipelined architecture for partitioned DWT based lossy image compression using FPGA's

An FPGA-based video compressor for H.263 compatible bit streams

FPGA implementation of a novel, fast motion estimation algorithm for real-time video compression

Runtime and quality tradeoffs in FPGA placement and routing

Content Provider	ACM Digital Library
Author	Hauck, Scott Mulpuri, Chandra
Abstract	Many applications of FPGAs, especially logic emulation and custom computing, require the quick placement and routing of circuit designs. In these applications, the advantages FPGA-based systems have over software simulation are diminished by the long run-times of current CAD software used to map the circuit onto FPGAs. To improve the run-time advantage of FPGA systems, users may be willing to trade some mapping quality for a reduction in CAD tool runtimes. In this paper, we seek to establish how much quality degradation is necessary to achieve a given runtime improvement. For this purpose, we implemented and investigated numerous placement and routing algorithms for FPGAs. We also developed new tradeoff-oriented algorithms, where a tuning parameter can be used to control this quality vs. runtime tradeoff. We show how different algorithms can achieve different points within this tradeoff spectrum, as well as how a single algorithm can be tuned to form a curve in the spectrum. We demonstrate that the algorithms vary widely in their tradeoffs, with the fastest algorithm being 8x faster than the slowest, and the highest quality algorithm being 5x better than the least quality algorithm. Compared to the commercial Xilinx CAD tools, we can achieve a 3x speed-up by allowing 1.27x degradation in quality, and a factor of 1.6x quality improvement with 2x slowdown.
Starting Page	29
Ending Page	36
Page Count	8
File Format	PDF
ISBN	1581133413
DOI	10.1145/360276.360294
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2001-02-01
Publisher Place	New York
Access Restriction	Subscribed
Subject Keyword	Fpgas Placement Routing Computer-aided design Fast cad for fpgas
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Runtime and Quality Tradeoffs in FPGA Placement and Routing

A fast discrete placement algorithm for FPGAs

Accelerating FPGA Routing Through Parallelization and Engineering Enhancements Special Section on PAR-CAD 2010

FPGA Placement and Routing: Understanding the Tradeoffs

Runtime and quality tradeoffs in fpga placement and routing.

Physical design for FPGAs

Routing-architecture-aware analytical placement for heterogeneous FPGAs

Reducing FPGA Router Run-Time through Algorithm and Architecture

Fast congestion-aware timing-driven placement for island FPGA

Runtime and quality tradeoffs in FPGA placement and routing

Similar Documents

Runtime and Quality Tradeoffs in FPGA Placement and Routing

A fast discrete placement algorithm for FPGAs

Accelerating FPGA Routing Through Parallelization and Engineering Enhancements Special Section on PAR-CAD 2010

FPGA Placement and Routing: Understanding the Tradeoffs

Runtime and quality tradeoffs in fpga placement and routing.

Physical design for FPGAs

Routing-architecture-aware analytical placement for heterogeneous FPGAs

Reducing FPGA Router Run-Time through Algorithm and Architecture

Fast congestion-aware timing-driven placement for island FPGA

Runtime and quality tradeoffs in FPGA placement and routing