Julien Lamoureux and Steven J.E Wilton ICCAD 2003 1.

Slides:

Advertisements

Similar presentations

1/48 ENERGY OPTIMIZATION TECHNIQUES: FPGA GLITCH REDUCTION Patrick Cooke and Elizabeth Graham.

Advertisements

ECE 506 Reconfigurable Computing Lecture 6 Clustering Ali Akoglu.

Interconnect Complexity-Aware FPGA Placement Using Rent’s Rule G. Parthasarathy Malgorzata Marek-Sadowska Arindam Mukherjee Amit Singh University of California,

Power Visualization, Analysis, and Optimization Tools for FPGAs Matthew French, Li Wang and Michael Wirthlin USC, Information Sciences Institute, BYU.

Architecture Design Methodology. 2 The effects of architecture design on metrics:  Area (cost)  Performance  Power Target market:  A set of application.

Clustering of Large Designs for Channel-Width Constrained FPGAs Marvin TomGuy Lemieux University of British Columbia Department of Electrical and Computer.

Yan Lin, Fei Li and Lei He EE Department, UCLA

Power Modeling and Architecture Evaluation for FPGA with Novel Circuits for Vdd Programmability Yan Lin, Fei Li and Lei He EE Department, UCLA

An Efficient Chiplevel Time Slack Allocation Algorithm for Dual-Vdd FPGA Power Reduction Yan Lin 1, Yu Hu 1, Lei He 1 and Vijay Raghunathan 2 1 EE Department,

CS294-6 Reconfigurable Computing Day 2 August 27, 1998 FPGA Introduction.

Stochastic Physical Synthesis for FPGAs with Pre-routing Interconnect Uncertainty and Process Variation Yan Lin and Lei He EE Department, UCLA

© 2005 Altera Corporation © 2006 Altera Corporation Placement and Timing for FPGAs Considering Variations Yan Lin 1, Mike Hutton 2 and Lei He 1 1 EE Department,

Architecture and Synthesis for Power-Efficient FPGAs Jason Cong University of California, Los Angeles Partially supported by NSF Grants.

CS294-6 Reconfigurable Computing Day 14 October 7/8, 1998 Computing with Lookup Tables.

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.

A Resource-level Parallel Approach for Global-routing-based Routing Congestion Estimation and a Method to Quantify Estimation Accuracy Wen-Hao Liu, Zhen-Yu.

User Programmable Logic Device: Architecture and CAD Tools TingTing Hwang and C. L. Liu.

ECE 506 Reconfigurable Computing Lecture 7 FPGA Placement.

ECE 506 Reconfigurable Computing Lecture 8 FPGA Placement.

Power Reduction for FPGA using Multiple Vdd/Vth

Titan: Large and Complex Benchmarks in Academic CAD

POWER-DRIVEN MAPPING K-LUT-BASED FPGA CIRCUITS I. Bucur, N. Cupcea, C. Stefanescu, A. Surpateanu Computer Science and Engineering Department, University.

LOPASS: A Low Power Architectural Synthesis for FPGAs with Interconnect Estimation and Optimization Harikrishnan K.C. University of Massachusetts Amherst.

Channel Width Reduction Techniques for System-on-Chip Circuits in Field-Programmable Gate Arrays Marvin Tom University of British Columbia Department of.

High-Level Interconnect Architectures for FPGAs An investigation into network-based interconnect systems for existing and future FPGA architectures Nick.

Solving Hard Instances of FPGA Routing with a Congestion-Optimal Restrained-Norm Path Search Space Keith So School of Computer Science and Engineering.

Wen-Hao Liu 1, Yih-Lang Li 1, and Kai-Yuan Chao 2 1 Department of Computer Science, National Chiao-Tung University, Hsin-Chu, Taiwan 2 Intel Architecture.

High-Level Interconnect Architectures for FPGAs Nick Barrow-Williams.

1 Wire Length Prediction-based Technology Mapping and Fanout Optimization Qinghua Liu Malgorzata Marek-Sadowska VLSI Design Automation Lab UC-Santa Barbara.

A NEW ECO TECHNOLOGY FOR FUNCTIONAL CHANGES AND REMOVING TIMING VIOLATIONS Jui-Hung Hung, Yao-Kai Yeh,Yung-Sheng Tseng and Tsai-Ming Hsieh Dept. of Information.

FPGA Routing Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

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.

A Routing Approach to Reduce Glitches in Low Power FPGAs Quang Dinh, Deming Chen, Martin D. F. Wong Department of Electrical and Computer Engineering University.

ECO Timing Optimization Using Spare Cells Yen-Pin Chen, Jia-Wei Fang, and Yao-Wen Chang ICCAD2007, Pages ICCAD2007, Pages

GLARE: Global and Local Wiring Aware Routability Evaluation Yaoguang Wei1, Cliff Sze, Natarajan Viswanathan, Zhuo Li, Charles J. Alpert, Lakshmi Reddy,

Congestion Estimation and Localization in FPGAs: A Visual Tool for Interconnect Prediction David Yeager Darius Chiu Guy Lemieux The University of British.

Introduction to FPGAs Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.

1 - CPRE 583 (Reconfigurable Computing): VHDL to FPGA: A Tool Flow Overview Iowa State University (Ames) CPRE 583 Reconfigurable Computing Lecture 5: 9/7/2011.

1 A Min-Cost Flow Based Detailed Router for FPGAs Seokjin Lee *, Yongseok Cheon *, D. F. Wong + * The University of Texas at Austin + University of Illinois.

Timing-Driven Routing for FPGAs Based on Lagrangian Relaxation

Simultaneous Analog Placement and Routing with Current Flow and Current Density Considerations H.C. Ou, H.C.C. Chien and Y.W. Chang Electronics Engineering,

Parallel Routing for FPGAs based on the operator formulation

1 Synthesizing Datapath Circuits for FPGAs With Emphasis on Area Minimization Andy Ye, David Lewis, Jonathan Rose Department of Electrical and Computer.

QUIZ 1. Question 1) According to the study on “Simultaneous Timing Driven Clustering and Placement for FPGAs”, what is a fragment level move and which.

1 Carnegie Mellon University Center for Silicon System Implementation An Architectural Exploration of Via Patterned Gate Arrays Chetan Patel, Anthony Cozzie,

Routability-driven Floorplanning With Buffer Planning Chiu Wing Sham Evangeline F. Y. Young Department of Computer Science & Engineering The Chinese University.

FPGA CAD 10-MAR-2003.

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.

1 Field-programmable Gate Array Architectures and Algorithms Optimized for Implementing Datapath Circuits Andy Gean Ye University of Toronto.

1 WireMap FPGA Technology Mapping for Improved Routability Stephen Jang, Xilinx Inc. Billy Chan, Xilinx Inc. Kevin Chung, Xilinx Inc. Alan Mishchenko,

© PSU Variation Aware Placement in FPGAs Suresh Srinivasan and Vijaykrishnan Narayanan Pennsylvania State University, University Park.

Architecture and algorithm for synthesizable embedded programmable logic core Noha Kafafi, Kimberly Bozman, Steven J. E. Wilton 2003 Field programmable.

A Novel Timing-Driven Global Routing Algorithm Considering Coupling Effects for High Performance Circuit Design Jingyu Xu, Xianlong Hong, Tong Jing, Yici.

Register-Transfer (RT) Synthesis 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.

ECE 506 Reconfigurable Computing Lecture 5 Logic Block Architecture Ali Akoglu.

Network Problems A D O B T E C

Placement and Routing Algorithms. 2 FPGA Placement & Routing.

A Study of the Scalability of On-Chip Routing for Just-in-Time FPGA Compilation Roman Lysecky a, Frank Vahid a*, Sheldon X.-D. Tan b a Department of Computer.

1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.

Time-borrowing platform in the Xilinx UltraScale+ family of FPGAs and MPSoCs Ilya Ganusov, Benjamin Devlin.

Placement study at ESA Filomena Decuzzi David Merodio Codinachs

Mapping into LUT Structures

Andy Ye, Jonathan Rose, David Lewis

An Active Glitch Elimination Technique for FPGAs

Register-Transfer (RT) Synthesis

Off-path Leakage Power Aware Routing for SRAM-based FPGAs

A New Hybrid FPGA with Nanoscale Clusters and CMOS Routing Reza M. P

Measuring the Gap between FPGAs and ASICs

Chapter 3b Leakage Efficient Chip-Level Dual-Vdd Assignment with Time Slack Allocation for FPGA Power Reduction Prof. Lei He Electrical Engineering Department.

Presentation transcript:

Julien Lamoureux and Steven J.E Wilton ICCAD

 Introduction  Algorithms  Experimental results  Conclusion 2

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 3

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 4

A B C D E mapping f2f2 f3f3 f1f1 A B C D E F Technology mapping transforms a netlist of gates and registers into a netlist of K-input lookup tables (K- LUTs) and registers.... f SRAM x y z

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 6

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 7

Figure 1: An N cluster Figure 2: A LUT and flip-flop BLE 8

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 9

Technology Mapping(CutMap) Clustering(T-VPack) Placement(VPR:T-VPlace) Routing(VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 10

f3f3 f2f2 f1f1 A B C D E F f1f1 f2f2 f3f3 ABC D E F Mapping + Clustering Placement Routing 11

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 12

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 13

14

15

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 16

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 17

 T-VPack  P-T-VPack Crit(B) is a measure of how close LUT B is to being on the critical path, Nets(B) is the set of nets connected to LUT B, Nets(C) is the set of nets connected to the LUTs already selected for cluster C Activity(i) is the estimated switching activity of net i, Activity avg is the average switching activity of all the nets in the user circuit. 18

19

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-V-Place) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 20

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 21

 T-Vplace  P-T-VPlace q(i) is used to scale the bounding boxes to better estimate wirelength for nets with more than 3 terminals, as described in [9]. Delay(i,j) is the estimated delay of the connection from source i to sink j, CE is a constant, and Criticality(i,j) is an indication of how close to the critical path the connection is [9]. bb x (i) and bb y (i) are the x and y dimensions of the bounding box of net i 22

23

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 24

Technology Mapping(EMap) Clustering(P-T-VPack) Placement(P-T-VPlace) Routing(P-VPR Router) Circuit Delay / Area / Power Estimations FPGA CAD FLOWFPGA CAD FLOW FPGA CAD FLOWFPGA CAD FLOW 25

 VPR-Router  P-VPR-Router The baseline VPR router uses the following cost function to evaluate a routing track n while forming a connection from source i to sink j: b(n) is the “base cost”, h(n) is the historical congestion cost, and p(n) is the present congestion of node n. Activity(i) is the switching activity in net i, MaxActivity is the maximum switching activity of all the nets, and MaxActCrit is the maximum activity criticality that any net can have. cap(n) is the capacitance associated with routing resource node n and ActCrit(i) is the activity criticality of net i. 26

27

28

 3-LUTs mappings: With duplicationNo duplication