 Y. Hu, V. Shih, R. Majumdar and L. He, “Exploiting Symmetries to Speedup SAT-based Boolean Matching for Logic Synthesis of FPGAs”, TCAD 2008.  Y. Hu,

Slides:



Advertisements
Similar presentations
Abdullah Aldahami ( ) Jan 29,  This paper propose a new resynthesis algorithm for FPGA area reduction.  The existing resynthesis techniques.
Advertisements

Address comments to FPGA Area Reduction by Multi-Output Sequential Resynthesis Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1.
Exploiting Symmetry in SAT-Based Boolean Matching for Heterogeneous FPGA Technology Mapping Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1 Electrical.
Spartan-3 FPGA HDL Coding Techniques
ECE 506 Reconfigurable Computing Lecture 6 Clustering Ali Akoglu.
Design, Synthesis and Evaluation of Heterogeneous FPGA with Mixed LUTs and Macro-Gates Yu Hu 1, Satyaki Das 2, Steve Trimberger 2, and Lei He 1 1. Electrical.
Floating-Point FPGA (FPFPGA) Architecture and Modeling (A paper review) Jason Luu ECE University of Toronto Oct 27, 2009.
Cross-layer Optimized Placement and Routing for FPGA Soft Error Mitigation Keheng Huang 1,2, Yu Hu 1, and Xiaowei Li 1 1 Key Laboratory of Computer System.
Architecture Design Methodology. 2 The effects of architecture design on metrics:  Area (cost)  Performance  Power Target market:  A set of application.
Defect Tolerance for Yield Enhancement of FPGA Interconnect Using Fine-grain and Coarse-grain Redundancy Anthony J. Yu August 15, 2005.
Defect Tolerance for Yield Enhancement of FPGA Interconnect Using Fine-grain and Coarse-grain Redundancy Anthony J. Yu August 15, 2005.
Caltech CS184a Fall DeHon1 CS184a: Computer Architecture (Structures and Organization) Day17: November 20, 2000 Time Multiplexing.
Application Specific Instruction Generation for Configurable Processor Architectures VLSI CAD Lab Computer Science Department, UCLA Led by Jason Cong Yiping.
 Device and architecture co-optimization – Large search space – Need fast yet accurate power and delay estimator for FPGAs  Trace-based power and delay.
Penn ESE Spring DeHon 1 ESE (ESE534): Computer Organization Day 21: April 2, 2007 Time Multiplexing.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Exploiting Symmetry in SAT-Based Boolean Matching for Heterogeneous FPGA Technology Mapping Yu Hu 1, Victor Shih 2, Rupak Majumdar 2 and Lei He 1 1 Electrical.
Address comments to Robust FPGA Resynthesis Based on Fault-Tolerant Boolean Matching Yu Hu 1, Zhe Feng 1, Lei He 1 and Rupak Majumdar 2.
Yu Hu1, Satyaki Das2 Steve Trimberger2, and Lei He1
Rewiring – Review, Quantitative Analysis and Applications Matthew Tang Wai Chung CUHK CSE MPhil 10/11/2003.
1 Jianwei Dai, Lei Wang, and Faquir Jain Department of Electrical and Computer Engineering University of Connecticut Analysis of Defect Tolerance in Molecular.
03/08/2005 © J.-H. Jiang1 Retiming and Resynthesis EECS 290A – Spring 2005 UC Berkeley.
Optimality Study of Logic Synthesis for LUT-Based FPGAs Jason Cong and Kirill Minkovich VLSI CAD Lab Computer Science Department University of California,
FPGA Technology Mapping. 2 Technology mapping:  Implements the optimized nodes of the Boolean network to the target device library.  For FPGA, library.
GPGPU platforms GP - General Purpose computation using GPU
USING SAT-BASED CRAIG INTERPOLATION TO ENLARGE CLOCK GATING FUNCTIONS Ting-Hao Lin, Chung-Yang (Ric) Huang Graduate Institute of Electrical Engineering,
Networking Virtualization Using FPGAs Russell Tessier, Deepak Unnikrishnan, Dong Yin, and Lixin Gao Reconfigurable Computing Group Department of Electrical.
Lecture 2: Field Programmable Gate Arrays September 13, 2004 ECE 697F Reconfigurable Computing Lecture 2 Field Programmable Gate Arrays.
Philip Brisk 2 Paolo Ienne 2 Hadi Parandeh-Afshar 1,2 1: University of Tehran, ECE Department 2: EPFL, School of Computer and Communication Sciences Efficient.
Power Reduction for FPGA using Multiple Vdd/Vth
Channel Width Reduction Techniques for System-on-Chip Circuits in Field-Programmable Gate Arrays Marvin Tom University of British Columbia Department of.
CSE 494: Electronic Design Automation Lecture 2 VLSI Design, Physical Design Automation, Design Styles.
05/04/06 1 Integrating Logic Synthesis, Tech mapping and Retiming Presented by Atchuthan Perinkulam Based on the above paper by A. Mishchenko et al, UCAL.
Reconfigurable Computing Using Content Addressable Memory (CAM) for Improved Performance and Resource Usage Group Members: Anderson Raid Marie Beltrao.
Design Space Exploration for Application Specific FPGAs in System-on-a-Chip Designs Mark Hammerquist, Roman Lysecky Department of Electrical and Computer.
Combinational and Sequential Mapping with Priority Cuts Alan Mishchenko Sungmin Cho Satrajit Chatterjee Robert Brayton UC Berkeley.
ISSS 2001, Montréal1 ISSS’01 S.Derrien, S.Rajopadhye, S.Sur-Kolay* IRISA France *ISI calcutta Combined Instruction and Loop Level Parallelism for Regular.
Introduction to FPGAs Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
Modeling Mobile-Agent-based Collaborative Processing in Sensor Networks Using Generalized Stochastic Petri Nets Hongtao Du, Hairong Qi, Gregory Peterson.
Section 1  Quickly identify faulty components  Design new, efficient testing methodologies to offset the complexity of FPGA testing as compared to.
ATS Exploiting Free LUT Entries to Mitigate Soft Errors in SRAM- based FPGAs Keheng Huang, Yu Hu, Xiaowei Li Institute of Computing Technology Chinese.
1 Stephen Jang Kevin Chung Xilinx Inc. Alan Mishchenko Robert Brayton UC Berkeley Power Optimization Toolbox for Logic Synthesis and Mapping.
Arithmetic Test Pattern Generation: A Bit Level Formulation of the Optimization Problem S. Manich, L. García and J. Figueras.
An Improved “Soft” eFPGA Design and Implementation Strategy
Optimality FPGA Technology Mapping: A Study of Optimality Andrew C. Ling M.A.Sc. Candidate University of Toronto Deshanand P. Singh Ph.D. Altera Corporation.
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.
Research Roadmap Past – Present – Future Robert Brayton Alan Mishchenko Logic Synthesis and Verification Group UC Berkeley.
Custom Computing Machines for the Set Covering Problem Paper Written By: Christian Plessl and Marco Platzner Swiss Federal Institute of Technology, 2002.
FPGA Logic Cluster Design Dr. Philip Brisk Department of Computer Science and Engineering University of California, Riverside CS 223.
IPR: In-Place Reconfiguration for FPGA Fault Tolerance Zhe Feng 1, Yu Hu 1, Lei He 1 and Rupak Majumdar 2 1 Electrical Engineering Department 2 Computer.
Lecture 17: Dynamic Reconfiguration I November 10, 2004 ECE 697F Reconfigurable Computing Lecture 17 Dynamic Reconfiguration I Acknowledgement: Andre DeHon.
Philip Brisk 2 Paolo Ienne 2 Hadi Parandeh-Afshar 1,2 1: University of Tehran, ECE Department 2: EPFL, School of Computer and Communication Sciences Improving.
CprE / ComS 583 Reconfigurable Computing Prof. Joseph Zambreno Department of Electrical and Computer Engineering Iowa State University Lecture #22 – Multi-Context.
1 Architecture of Datapath- oriented Coarse-grain Logic and Routing for FPGAs Andy Ye, Jonathan Rose, David Lewis Department of Electrical and Computer.
Fault-Tolerant Resynthesis for Dual-Output LUTs Roy Lee 1, Yu Hu 1, Rupak Majumdar 2, Lei He 1 and Minming Li 3 1 Electrical Engineering Dept., UCLA 2.
Author: Yun R. Qu, Shijie Zhou, and Viktor K. Prasanna Publisher:
A New Logic Synthesis, ExorBDS
IPF: In-Place X-Filling to Mitigate Soft Errors in SRAM-based FPGAs
Robust FPGA Resynthesis Based on Fault-Tolerant Boolean Matching
Technology Mapping into General Programmable Cells
Mapping into LUT Structures
Samuel Luckenbill1, Ju-Yueh Lee2, Yu Hu3, Rupak Majumdar1, and Lei He2
Leakage-Aware FPGA Re-synthesis
Redundancy-Aware, Fault-Tolerant Clustering
SAT-Based Optimization with Don’t-Cares Revisited
FPGA Logic Synthesis using Quantified Boolean Satisfiability
FPGA Glitch Power Analysis and Reduction
Innovative Sequential Synthesis and Verification
Robert Brayton Alan Mishchenko Niklas Een
August 8, 2006 Danny Budik, Itamar Elhanany Machine Intelligence Lab
Presentation transcript:

 Y. Hu, V. Shih, R. Majumdar and L. He, “Exploiting Symmetries to Speedup SAT-based Boolean Matching for Logic Synthesis of FPGAs”, TCAD  Y. Hu, V. Shih, R. Majumdar and L. He, “FPGA Area Reduction by Multi- Output Function Based Sequential Resynthesis”, DAC  Y. Hu, Z. Feng, R. Majumdar and L. He, “Robust FPGA Resynthesis Based on Fault-Tolerant Boolean Matching”, ICCAD FPGA Resynthesis for Area and Reliability Abstract Resynthesis, a circuit rewriting technique in FPGA CAD flow, has emerged to cope with the inherent NP-hardness of many CAD tasks and the ever increasing design complexity and logic capacity of FPGAs. Targeting area and reliability optimization, this project proposed two logic resynthesis algorithms by applying an efficient SAT-based Boolean matching as the optimization engine. In contrast to existing resynthesis, our proposed algorithms explore multiple design freedoms and architecture features in order to achieve better quality. Motivations  Heuristic FPGA synthesis results in sub-optimal 500X gap exists between optimal and heuristic technology mapping [Cong, FPGA’06] Growing design complexity and FPGA capacity increases the optimality gap  Resynthesis is needed to improve quality (area/performance/power/reliability) Rewrite the logic or physical design Perform iterations for design closure 1 Resynthesis for Area & SER SAT-based Boolean Matching MIMO&Retiming for Area References Student: Yu Hu (Ph.D., 2009) Advisor: Lei He EDA Lab, Electrical Engineering Department, UCLA Area-Aware Resynthesis Resynthesis Framework Area Reduction Results Exploring Symmetries in BM  SAT-BM can be much faster if we explore symmetries in Boolean function, e.g., b and c are symmetric in a(b+c) FPGA PLB architecture, e.g., pins in an LUT are symmetric 7 14 Proposed Resynthesis  Resynthesis based on LUT reconfiguration Leverage the inherent flexibility in LUT-based FPGA Reduce area without performance degradation Increase reliability with negligible area overhead  A SAT-based Boolean matching is the key  A formal method ensuring correct-by-construction  Flexible enough to deal with heterogeneous FPGA  Efficient proposed implementation for scalability 3  200X speedup  Multi-iterations of block-based re-mapping  Sequential resynthesis obtains up to 9% area  Factors to sequential resynthesis quality Sequential structure PLB templates, the number of iterations  SER model: [Mukherjee, HPCA, 2005]  Assume large industrial FPGA: 330,000 LUTs Robust PLB Structure Stochastic Resynthesis Fault-Tolerant Boolean Matching MTTF Evaluation  Different synthesis algorithms lead to different area-robustness tradeoffs  Stochastic resynthesis maximizes the yield rate under random faults  No testing overhead, negligible area/performance overhead  Boolean matching answers a Yes-No question  Can PLB p implement Boolean function f?  If yes, give the configuration bits for all LUTs in p.  Each re-mapping is based on SAT-BM Retiming breaks register boundaries for resynthesis Function of O 2 has to be preserved, i.e., c and e need to be duplicated, which is not required if MIMO block is considered.  Case I: Classic retiming w/o duplication  Case II: Peripheral retiming w/o duplication  Case III: Peripheral retiming w duplication  Both faults in LUT configuration and interconnect are considered and modeled as random variables. 18 synthesis solutions for MCNC-i10  Input:  PLB template H and Boolean function F  Fault rate for the inputs and SRAM bits of PLB H  Output:  Either that F cannot be implemented by PLB H  Or that the configuration of H which minimizes the probability that faults are observable in the output of the PLB under all input vectors  Fault-Tolerant BM task breakdown  Find multiple Boolean matching  Evaluate the stochastic fault rate Deterministic SAT vs. SSAT Deterministic SAT Stochastic SAT GUI Version 1 Faults in intermediate wires Faults in LUT configurations Satisfiability don’t-care Observability don’t-care  Robust PLB structure introduces more potential for don’t-cares  Stochastic resynthesis maximizes don’t-cares w/ FTBM and robust PLB 31% MTTF increase! LUT utilization is low for Xilinx V-5 FPGA 5