Enhancing the Area-Efficiency of FPGAs with Hard Blocks Using Shadow Clusters Peter Jamieson and Jonathan Rose.

Slides:



Advertisements
Similar presentations
FPGA and ASIC Technology Comparison - 1 © 2009 Xilinx, Inc. All Rights Reserved FPGA and ASIC Technology Comparison, Part 2.
Advertisements

Hao wang and Jyh-Charn (Steve) Liu
14. Aug Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware SAC 2013, Burnaby, Canada Thomas Pöppelmann and Tim Güneysu.
A HIGH-PERFORMANCE IPV6 LOOKUP ENGINE ON FPGA Author : Thilan Ganegedara, Viktor Prasanna Publisher : FPL 2013.
ECE 506 Reconfigurable Computing Lecture 6 Clustering Ali Akoglu.
Architectural Improvement for Field Programmable Counter Array: Enabling Efficient Synthesis of Fast Compressor Trees on FPGA Alessandro Cevrero 1,2 Panagiotis.
A Survey of Logic Block Architectures For Digital Signal Processing Applications.
Floating-Point FPGA (FPFPGA) Architecture and Modeling (A paper review) Jason Luu ECE University of Toronto Oct 27, 2009.
Reducing the Pressure on Routing Resources of FPGAs with Generic Logic Chains Hadi P. Afshar Joint work with: Grace Zgheib, Philip Brisk and Paolo Ienne.
EECE579: Digital Design Flows
Lecture 2: Field Programmable Gate Arrays I September 5, 2013 ECE 636 Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays I.
FPGA chips and DSP Algorithms By Emily Fabes. 2 Agenda FPGA Background Reasons to use FPGA’s Advantages and disadvantages of using FPGA’s Sample VHDL.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.
The Spartan 3e FPGA. CS/EE 3710 The Spartan 3e FPGA  What’s inside the chip? How does it implement random logic? What other features can you use?  What.
Lecture 3: Field Programmable Gate Arrays II September 10, 2013 ECE 636 Reconfigurable Computing Lecture 3 Field Programmable Gate Arrays II.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
ASIC vs. FPGA – A Comparisson Hardware-Software Codesign Voin Legourski.
LabVIEW Design of Digital Integrated Circuits FPGA IC Implantation.
CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.
1 3/22/02 Benchmark Update u Carnegie Cell Library: “Free to all who Enter” s Need to build scaling model of standard cell library s Based on our open.
The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays The Memory/Logic Interface in FPGA’s with Large Embedded Memory Arrays Steven J.
Physical Implementation 1)Manufactured Integrated Circuit (IC) Technologies 2)Programmable IC Technology 3)Other Technologies Manufactured IC Technologies.
HARP: Hard-Wired Routing Pattern FPGAs Cristinel Ababei , Satish Sivaswamy ,Gang Wang , Kia Bazargan , Ryan Kastner , Eli Bozorgzadeh   ECE Dept.
Using FPGAs with Embedded Processors for Complete Hardware and Software Systems Jonah Weber May 2, 2006.
Specific Choice of Soft Processor Features Mark Grover Prof. Greg Steffan Dept. of Electrical and Computer Engineering.
Read Only Memory (ROM) Number of words Size of word A block diagram of a ROM consisting of k inputs and n outputs is shown below. The inputs provide the.
Multiplication with Base 10 Pieces Modeling Multiplication With your Base Ten blocks, model the problem: 3 x 5 Let’s see the example below… How.
Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.
FPGA and CADs Presented by Peng Du & Xiaojun Bao.
FPGA Switch Block Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Coarse and Fine Grain Programmable Overlay Architectures for FPGAs
Steve Poret RCS – ENG 6530 June 10, [1] Measuring the Gap between FPGAs and ASICs  Ian Kuon and Jonathan Rose  The Edward S. Rogers Sr. Department.
Un/DoPack: Re-Clustering of Large System-on-Chip Designs with Interconnect Variation for Low-Cost FPGAs Marvin Tom* Xilinx Inc.
1 Rapid Estimation of Power Consumption for Hybrid FPGAs Chun Hok Ho 1, Philip Leong 2, Wayne Luk 1, Steve Wilton 3 1 Department of Computing, Imperial.
Decimal Multiplier on FPGA using Embedded Binary Multipliers Authors: H. Neto and M. Vestias Conference: Field Programmable Logic and Applications (FPL),
A Flexible DSP Block to Enhance FGPA Arithmetic Performance
J. Christiansen, CERN - EP/MIC
Heterogeneous FPGA architecture and CAD Peter Jamieson Supervisor: Jonathan Rose.
Fundamental Digital Electronics (Spring 2014) Martino Poggio.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR FPGA Fabric n Elements of an FPGA fabric –Logic element –Placement –Wiring –I/O.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
Fall 2000M.B. Ibáñez Lecture 17 Paging Hardware Support.
Background Motivation Implementation Conclusion 2.
Topics Architecture of FPGA: Logic elements. Interconnect. Pins.
1 Synthesizing Datapath Circuits for FPGAs With Emphasis on Area Minimization Andy Ye, David Lewis, Jonathan Rose Department of Electrical and Computer.
A Synthesizable Datapath-Oriented Programmable Logic Core Steven J.E. Wilton, Chun Hok Ho, Philip Leong, Wayne Luk, Brad Quinton University of British.
ESS | FPGA for Dummies | | Maurizio Donna FPGA for Dummies Basic FPGA architecture.
An Improved “Soft” eFPGA Design and Implementation Strategy
In-Place Decomposition for Robustness in FPGA Ju-Yueh Lee, Zhe Feng, and Lei He Electrical Engineering Dept., UCLA Presented by Ju-Yueh Lee Address comments.
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Routing Wire Optimization through Generic Synthesis on FPGA Carry Hadi P. Afshar Joint work with: Grace Zgheib, Philip Brisk and Paolo Ienne.
Click to edit Master title style Literature Review Measuring the Gap Between FPGAs and ASICs Ian Kuon, Jonathan Rose University of Toronto IEEE TCAD/ICAS.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
Reconfigurable Architectures Greg Stitt ECE Department University of Florida.
Congestion-Driven Re-Clustering for Low-cost FPGAs MASc Examination Darius Chiu Supervisor: Dr. Guy Lemieux University of British Columbia Department of.
Reconfigurable Supercomputing (2) Key Issues in HPC  Leveling off of performance Traditional Scalar/Vector – long product cycles, too few vendors.
A Brief Introduction to FPGAs
Multiply 2-digit numbers using partial products. Let’s Review You can use base-ten blocks to multiply smaller numbers. Use blocks or quick pics to multiply:
1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.
1 Comparing FPGA vs. Custom CMOS and the Impact on Processor Microarchitecture Henry Wong Vaughn Betz, Jonathan Rose.
Floating-Point FPGA (FPFPGA)
Application-Specific Customization of Soft Processor Microarchitecture
Instructor: Dr. Phillip Jones
Square Numbers and Square Roots
أهداف الفصل الفرق بين الموازنة المرنة والثابتة .
Measuring the Gap between FPGAs and ASICs
Multiplication with Base 10 Pieces
Application-Specific Customization of Soft Processor Microarchitecture
♪ Embedded System Design: Synthesizing Music Using Programmable Logic
Reconfigurable Computing (EN2911X, Fall07)
Presentation transcript:

Enhancing the Area-Efficiency of FPGAs with Hard Blocks Using Shadow Clusters Peter Jamieson and Jonathan Rose

Modern FPGAs Consist of: 1.Programmable logic and routing soft logic cluster tile 2.Dedicated hard circuits e.g. multiplier tile e.g memory block tile

Fundamental FPGA Question Hard circuits provide benefit when used –Faster –Smaller –Consume less power

However… If not used Waste Area for Logic

However… If not used Waste Area for Logic Routing resources wasted!!! 70-90% of FPGA area occupied by routing

Improve Area-Efficiency of Hard Block Add flexibility so we can use hard circuit more often

Improve Area-Efficiency of Hard Block Add flexibility so we can use hard circuit more often Why not soft logic SHADOW CLUSTER

Example 1 FPGA has 1 mult. for every 4 pieces of soft logic Result is same for both shadow and non-shadow

Example 2 FPGA has 1 mult. for every 4 pieces of soft logic

Example 2 FPGA has 1 mult. for every 4 pieces of soft logic Here, shadow cluster FPGA is 2/3 the size

Notes Wins even though hard circuit with shadow cluster is slightly bigger! Benchmarks statistical demand for multipliers key –Average and Variance

One Interesting Result Virtex4 SX like FPGA with shadow clusters 7.5% smaller than without