Lecture 3: Field Programmable Gate Arrays II September 10, 2013 ECE 636 Reconfigurable Computing Lecture 3 Field Programmable Gate Arrays II.

Slides:



Advertisements
Similar presentations
Defect Tolerance for Yield Enhancement of FPGA Interconnect Using Fine-grain and Coarse-grain Redundancy Anthony J. YuGuy G.F. Lemieux September 15, 2005.
Advertisements

Commercial FPGAs: Altera Stratix Family Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Penn ESE534 Spring DeHon 1 ESE534: Computer Organization Day 14: March 19, 2014 Compute 2: Cascades, ALUs, PLAs.
ECE 506 Reconfigurable Computing Lecture 6 Clustering Ali Akoglu.
Architecture Design Methodology. 2 The effects of architecture design on metrics:  Area (cost)  Performance  Power Target market:  A set of application.
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.
Lecture 26: Reconfigurable Computing May 11, 2004 ECE 669 Parallel Computer Architecture Reconfigurable Computing.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day8: October 18, 2000 Computing Elements 1: LUTs.
Power Modeling and Architecture Evaluation for FPGA with Novel Circuits for Vdd Programmability Yan Lin, Fei Li and Lei He EE Department, UCLA
Evolution of implementation technologies
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 11: February 14, 2007 Compute 1: LUTs.
The Future of FPGA Interconnect Guy Lemieux The University of British Columbia Tuesday, December 8, 2009 FPT 2009 Workshop Getting the LUT-heads to work…
CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.
Lecture 3 1 ECE 412: Microcomputer Laboratory Lecture 3: Introduction to FPGAs.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 12: February 21, 2007 Compute 2: Cascades, ALUs, PLAs.
CprE / ComS 583 Reconfigurable Computing Prof. Joseph Zambreno Department of Electrical and Computer Engineering Iowa State University Lecture #3 – FPGA.
Yehdhih Ould Mohammed Moctar1 Nithin George2 Hadi Parandeh-Afshar2
Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.
DSD Presentation Introduction of Actel FPGA. page 22015/9/11 Presentation Outline  Overview  Actel FPGA Characteristic  Actel FPGA Architecture  Actel.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n Circuit design for FPGAs: –Logic elements. –Interconnect.
Placement by Simulated Annealing. Simulated Annealing  Simulates annealing process for placement  Initial placement −Random positions  Perturb by block.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 15: February 12, 2003 Interconnect 5: Meshes.
ESE Spring DeHon 1 ESE534: Computer Organization Day 19: April 7, 2014 Interconnect 5: Meshes.
Power Reduction for FPGA using Multiple Vdd/Vth
Titan: Large and Complex Benchmarks in Academic CAD
CBSSS 2002: DeHon Costs André DeHon Wednesday, June 19, 2002.
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.
Field Programmable Gate Arrays (FPGAs) An Enabling Technology.
Design Space Exploration for Application Specific FPGAs in System-on-a-Chip Designs Mark Hammerquist, Roman Lysecky Department of Electrical and Computer.
FPGA Global Routing Architecture Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
CprE / ComS 583 Reconfigurable Computing Prof. Joseph Zambreno Department of Electrical and Computer Engineering Iowa State University Lecture #4 – FPGA.
Topics Architecture of FPGA: Logic elements. Interconnect. Pins.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Circuit design for FPGAs n Static CMOS gate vs. LUT n LE output drivers n Interconnect.
Section 1  Quickly identify faulty components  Design new, efficient testing methodologies to offset the complexity of FPGA testing as compared to.
1 Leakage Power Analysis of a 90nm FPGA Authors: Tim Tuan (Xilinx), Bocheng Lai (UCLA) Presenter: Sang-Kyo Han (ECE, University of Maryland) Published.
1 Synthesizing Datapath Circuits for FPGAs With Emphasis on Area Minimization Andy Ye, David Lewis, Jonathan Rose Department of Electrical and Computer.
M.Mohajjel. Why? TTM (Time-to-market) Prototyping Reconfigurable and Custom Computing 2Digital System Design.
FPGA-Based System Design: Chapter 1 Copyright  2004 Prentice Hall PTR Moore’s Law n Gordon Moore: co-founder of Intel. n Predicted that number of transistors.
Directional and Single-Driver Wires in FPGA Interconnect Guy Lemieux Edmund LeeMarvin TomAnthony Yu Dept. of ECE, University of British Columbia Vancouver,
An Improved “Soft” eFPGA Design and Implementation Strategy
1 Field-programmable Gate Array Architectures and Algorithms Optimized for Implementing Datapath Circuits Andy Gean Ye University of Toronto.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 10: January 31, 2003 Compute 2:
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Lecture 17: Dynamic Reconfiguration I November 10, 2004 ECE 697F Reconfigurable Computing Lecture 17 Dynamic Reconfiguration I Acknowledgement: Andre DeHon.
Caltech CS184 Winter DeHon 1 CS184a: Computer Architecture (Structure and Organization) Day 11: January 31, 2005 Compute 1: LUTs.
ESE Spring DeHon 1 ESE534: Computer Organization Day 18: March 26, 2012 Interconnect 5: Meshes (and MoT)
ECE 506 Reconfigurable Computing Lecture 5 Logic Block Architecture Ali Akoglu.
Interconnect Driver Design for Long Wires in FPGAs Edmund Lee, Guy Lemieux & Shahriar Mirabbasi University of British Columbia, Canada Electrical & Computer.
ESE Spring DeHon 1 ESE534: Computer Organization Day 20: April 9, 2014 Interconnect 6: Direct Drive, MoT.
FPGA-Based System Design: Chapter 3 Copyright  2004 Prentice Hall PTR Topics n FPGA fabric architecture concepts.
1 - ECpE 583 (Reconfigurable Computing): Midterm Overview Iowa State University (Ames) CPRE 583 Reconfigurable Computing Lecture 17: Wed 10/21/2011 (Midterm.
1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.
Field Programmable Gate Arrays
ESE534: Computer Organization
Give qualifications of instructors: DAP
CS184a: Computer Architecture (Structure and Organization)
Multiple Drain Transistor-Based FPGA Architectures
Topics Antifuse-based FPGA fabrics: Flash-based FPGAs Actel.
Topics Circuit design for FPGAs: Logic elements. Interconnect.
An Active Glitch Elimination Technique for FPGAs
ESE534: Computer Organization
CprE / ComS 583 Reconfigurable Computing
Give qualifications of instructors: DAP
CS184a: Computer Architecture (Structure and Organization)
CprE / ComS 583 Reconfigurable Computing
Reconfigurable Computing (EN2911X, Fall07)
Presentation transcript:

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 ECE 636 Reconfigurable Computing Lecture 3 Field Programmable Gate Arrays II

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Overview Anti-fuse and EEPROM-based devices Contemporary SRAM devices -Wiring -Embedded New trends -Single-driver wiring -Power optimization

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Architectural Issues – Ahmed and Rose What values of N, I, and K minimize the following parameters? -Area -Delay -Area-delay product Assumptions -All routing wires length 4 -Fully populated IMUX -Wiring is half pass transistor, half tri-state -180 nm -Routing performed with W min + 30% tracks

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Architectural Issues – Ahmed and Rose Differences from modern commercial FPGAs -Channel wires driven by muxes -Limited intra-cluster mux population -Carry chain/other circuitry Still provides interesting analysis

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Number of Inputs per Cluster Lots of opportunities for input sharing in large clusters (Betz – CICC’99) Reducing inputs reduces the size of the device and makes it faster. I = K/2 * (N + 1)

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Effect of N and K on Area Looks like cluster size N = 6-8 is good, K = 4-5

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Effect of N and K on Area Intra-cluster area

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Effect of N and K on Area Inter-cluster area

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Effect of N and K on Performance Inconclusive: Big K and N > 3 value looks good

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Effect of N and K on Area-delay product K = 4-6, N= 4-10 looks OK

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Motivation: Bidirectional Wires Problem Half of Tristate Buffers Left Unused Buffers Dominate Size of Device Courtesy: Lemieux

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Bidirectional vs Directional

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Bidirectional Switch Block

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Directional versus Bidirectional Switch Block Switch Block: Directional has Half as Many Switch Elements

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Building up Long Wires Connect MUX Inputs TURN UP from wire-ends to mux

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Building up Long Wires Add wire twisting

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Directional Wire Summary °Pros and Cons Good -Potential area savings -What does this do to CAD tools? Bad -Big input muxes, slower -Bigger quantum size (2*L) -Detailed-routing architecture is different (need new switch block)

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Bidirectional Wiring: Outputs are Tristates Multi-driver Wiring!!! Bidir Architecture

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Directional Wiring: Outputs can be Tristates Dir-Tri Architecture Multi-driver Wiring!!! Fanout increases delay

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Directional Wiring: Outputs can use switch block muxes Dir Architecture Single-driver Wiring!!! New connectivity constraint

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Area (Transistor Count)

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Delay

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Area-Delay Product

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Stratix II paper °Goals Improve device performance by ~50% (24% achieved from process shrink) Reduce area by ~50% (40% achieved from process shrink) °Process (90 nm – down from 130 nm for Stratix) °Use Ahmed results to explore larger LUT size °Look into fast routing

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 First 6-LUT Option – Composable LUT °Lots of issues

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Second 6-LUT Option – Fracturable LUT °Heading in the right direction

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Third 6-LUT Option – Shared LUT °More complicated, but efficient

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Cluster size selection for Stratix II °Bias towards slightly smaller cluster size due to size issues

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Fast connections for routing °Note mux construction

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Fast connections for routing °1 Fast option was chosen due to experimental noise

Lecture 3: Field Programmable Gate Arrays II September 10, 2013 Summary Recent work has reexamined values of N and K inside the cluster Performance remains an important issue although power is gaining Single-driver wiring reduces area and leads to improved performance Commercial architectures are quite advanced -Rely heavily on CAD tools Next topic: FPGA placement and routing