glitch minimization approaches in fpgas
play

Glitch Minimization Approaches in FPGAs Jrmie Dumas cole Normale - PowerPoint PPT Presentation

Nov 25, 2023 •308 likes •446 views

Glitch Minimization Approaches in FPGAs Jrmie Dumas cole Normale Suprieure de Lyon December 2011 Jrmie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 1 / 13 Motivations Performance driven algorithms for FPGAs Need for

  1. Glitch Minimization Approaches in FPGAs Jérémie Dumas École Normale Supérieure de Lyon December 2011 Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 1 / 13

  2. Motivations Performance driven algorithms for FPGAs Need for power-efficient methods : alternative goal Embeded technology, increased autonomy, green computing . . . Noise reduction Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 2 / 13

  3. Definitions Technology mapping, placement and routing Static power versus dynamic power (62 % of total power) Functional transitions versus spurious transitions (glitches) Intertial delay of 0 . 2 ns : smaller glitches are filtered Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 3 / 13

  4. Approaches GlitchMap, GlitchReroute, GlitchLess Optimizing the technology mapping (GlitchMap) Optimizing the routing (GlitchReroute) Physically inserting new elements (GlitchLess) Blend it together Here : GlitchLess and GlitchReroute. Takes place after routing. Does not alter the length of the critical path. Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 4 / 13

  5. The Programmable Delay Element Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 5 / 13

  6. Configuration Models Needed _ Delay ( n , f ) for each input signal f of node n Setting the Added _ Delay ( n , f ) using multiples of i · τ + cte Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 6 / 13

  7. Adding Delay Elements Experimentation Protocol HSPICE simulation software Versatile Place and Route (VPR) used for routing Parameters prior to configuration : min_in , max_in , num_in . . . Calibrations done with ideal parameters Experiments using LUT with K = 4 , 5 , 6 inputs Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 7 / 13

  8. Path Balancing A Rerouting Heuristic Graph with delays, Rip-up and re-route like VPR Target delay in range d ± ∆ , with ∆ = 1 2 · intertial _ delay A heuristic for selecting a pair ( s , t ) to reroute Critical path remain unchanged Considers essentially first-level clusters Selection heuristic Favors paths with more influence on the rest of the DAG Defavors paths that need great readjustment Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 8 / 13

  9. Source to Sink Rerouting (a) Single-edge path (b) Two-edge and recursive Looking for simple paths (without loop). Heuristic approach. Uses Dijkstra’s algorithm. Find paths s � s ′ − t ′ � t . Split the graph in two sets S and T . Two-edges and recursive extensions. Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 9 / 13

  10. Some Numbers Average Reductions Power savings : ≈ 18 % for GlitchLess and ≈ 11 % for GlitchReroute. Glitching activity : − 91 % for GlitchLess and − 27 % for GlitchReroute. Ideal dynamic power saving of 22 . 6 % . Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 10 / 13

  11. Downsides Power overhead, common in both scheme. Area overhead for GlitchLess ( ≈ 5 % ). Delay overhead for GlitchLess (from ≈ 0 . 2 % to ≈ 2 % ). Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 11 / 13

  12. Moral of the Story Dynamic power reduction techniques During the technology mapping, the routing process, or afterwards. Mapping : cut-enumeration based techniques. Low-power clustering. Problems are NP-Hard. Experimental protocol Simulation, models for signal propagation and power consumption . Estimating the switching activity with a probabilist approach. Multi-dimensional calibration by varying one parameter at a time. Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 12 / 13

  13. Thank you for your attention. Feel free to ask your questions. Jérémie Dumas (ENS de Lyon) Glitches in FPGAs December 2011 13 / 13

Recommend

with FP FPGAs: Cas ase Stu tudy on on a a Key-Value Store FPGAs in the Cloud Wider

with FP FPGAs: Cas ase Stu tudy on on a a Key-Value Store FPGAs in the Cloud Wider

Zsolt Istvn * , Gustavo Alonso, Ankit Singla Systems Group, Computer Science Dept., ETH Zrich * Now at IMDEA Software Institute, Madrid Providing Multi-tenant Services with FP FPGAs: Cas ase Stu tudy on on a a Key-Value Store FPGAs in

374 views • 15 slides
Combinatorial approaches to RNA folding Part II: Energy minimization via dynamic programming

Combinatorial approaches to RNA folding Part II: Energy minimization via dynamic programming

Combinatorial approaches to RNA folding Part II: Energy minimization via dynamic programming Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 4500, Spring 2017 M. Macauley

184 views • 15 slides
Glitch and veto studies in LIGOs S5 search for gravitational wave bursts Erik Katsavounidis

Glitch and veto studies in LIGOs S5 search for gravitational wave bursts Erik Katsavounidis

Glitch and veto studies in LIGOs S5 search for gravitational wave bursts Erik Katsavounidis MIT for the LIGO Scientific Collaboration 11 th GWDAW, Potsdam, Germany December 19, 2006 LIGO-G060638-00-Z 1 Glitch study requirements Low

481 views • 19 slides
Gravitational waves from the pulsar glitch recovery period Mark Bennett Anthony van Eysden

Gravitational waves from the pulsar glitch recovery period Mark Bennett Anthony van Eysden

Gravitational waves from the pulsar glitch recovery period Mark Bennett Anthony van Eysden Andrew Melatos University of Melbourne Overview Different types of signal from a pulsar glitch Calculate GW signal using simple model of a

404 views • 15 slides
Minimization of Energy Loss using Integrated Evolutionary Approaches

Minimization of Energy Loss using Integrated Evolutionary Approaches

Minimization of Energy Loss using Integrated Evolutionary Approaches

413 views • 24 slides
Minimization Using Descent Information we will consider the minimization of unconstrained

Minimization Using Descent Information we will consider the minimization of unconstrained

Minimization Using Descent Information we will consider the minimization of unconstrained functions of several variables where we now assume we have some derivative information such as the gradient vector or the Hessian matrix. Recall

131 views • 11 slides
FPGAs milliseconds+ to reconfjgure custom chips ??? (next week) FPGAs ??? GPUs

FPGAs milliseconds+ to reconfjgure custom chips ??? (next week) FPGAs ??? GPUs

FPGAs milliseconds+ to reconfjgure custom chips ??? (next week) FPGAs ??? GPUs vector computations examples: computation second processor specialized for particular the accelerator concept 2 fmexible, slower functional units

423 views • 11 slides
FPGAs 1 To read more This days papers: Brown and Rose, Architecture of FPGAs and

FPGAs 1 To read more This days papers: Brown and Rose, Architecture of FPGAs and

FPGAs 1 To read more This days papers: Brown and Rose, Architecture of FPGAs and CPLDs: A Tutorial. (no review required) Putnam et al, A Reconfjgurable Fabric for Accelerating Large-Scale Datacenter Services 1

821 views • 43 slides
HW/SW Codesign w/ FPGAs The Nature of HW/SW I ECE 522 Hardware Software Codesign with FPGAs

HW/SW Codesign w/ FPGAs The Nature of HW/SW I ECE 522 Hardware Software Codesign with FPGAs

HW/SW Codesign w/ FPGAs The Nature of HW/SW I ECE 522 Hardware Software Codesign with FPGAs Instructor: Prof. Jim Plusquellic Text: A Practical Introduction to Hardware/Software Codesign, 2nd Edition", Patrick Schaumont, Springer,

649 views • 10 slides
FPGAs 1 CMPE691/491: Advanced FPGA Design FPGAs Large array of configurable logic blocks

FPGAs 1 CMPE691/491: Advanced FPGA Design FPGAs Large array of configurable logic blocks

FPGAs 1 CMPE691/491: Advanced FPGA Design FPGAs Large array of configurable logic blocks (CLB) connected via programmable interconnects Features and Specifications of FPGAs Basic Programmable Devices Features and Specifications of FPGAs

1.13k views • 46 slides
Physical Design For FPGAs Rajeev Jayaraman Physical Implementation Tools Xilinx Inc. ISPD-2001

Physical Design For FPGAs Rajeev Jayaraman Physical Implementation Tools Xilinx Inc. ISPD-2001

Physical Design For FPGAs Rajeev Jayaraman Physical Implementation Tools Xilinx Inc. ISPD-2001 Do you know FPGAs? FPGAs are used only in prototyping and emulation systems? Can you design anything real in FPGAs? FPGAs are too

595 views • 48 slides
Efficient Multi-Ported Memories for FPGAs Eric LaForest Greg Steffan University of Toronto

Efficient Multi-Ported Memories for FPGAs Eric LaForest Greg Steffan University of Toronto

Efficient Multi-Ported Memories for FPGAs Eric LaForest Greg Steffan University of Toronto Computer Engineering Research Group February 22, 2010 Parallelism in FPGAs Larger SoCs on FPGAs Parallel Systems Parallel systems on FPGAs

680 views • 47 slides
A Network of Time Division Multiplexing for FPGAs Rosemary Francis Motivation FPGAs are

A Network of Time Division Multiplexing for FPGAs Rosemary Francis Motivation FPGAs are

A Network of Time Division Multiplexing for FPGAs Rosemary Francis Motivation FPGAs are now home to complex Systems on-Chip Designs require the use of Network-on- Chip FPGA global wiring is simple in comparison with ASIC

2.67k views • 19 slides
FPGAs as Tools and Architectures at ETH Systems FPGAs as Tools and Architectures at ETH Systems

FPGAs as Tools and Architectures at ETH Systems FPGAs as Tools and Architectures at ETH Systems

FPGAs as Tools and Architectures at ETH Systems FPGAs as Tools and Architectures at ETH Systems Real-Time Tracing and Verification The FPGA as a tool . Analysing a multi-Gb trace stream in real time. BRISC Research Architecture

804 views • 43 slides
Gigabit Ethernet Gigabit Ethernet implementation for implementation for FPGAs FPGAs Grzegorz

Gigabit Ethernet Gigabit Ethernet implementation for implementation for FPGAs FPGAs Grzegorz

Gigabit Ethernet Gigabit Ethernet implementation for implementation for FPGAs FPGAs Grzegorz Korcyl - Jagiellonian University, Krakw Grzegorz Korcyl PANDA TDAQ Workshop, Giessen April 2010 Outline Motivation 1. 2. General structure

292 views • 16 slides
Unit 18 Field Programmable Gate Arrays (FPGAs) Implementing Logic Functions with Memories 18.2

Unit 18 Field Programmable Gate Arrays (FPGAs) Implementing Logic Functions with Memories 18.2

18.1 Unit 18 Field Programmable Gate Arrays (FPGAs) Implementing Logic Functions with Memories 18.2 HARDWARE IMPLEMENTATION TARGETS 18.3 Processing Logic Approaches Application Recall HW/SW designs sit on a continuum Specific

660 views • 32 slides
Minimization Satoru Iwata (University of Tokyo) Submodular Function Minimization ( )

Minimization Satoru Iwata (University of Tokyo) Submodular Function Minimization ( )

Submodular Function Minimization Satoru Iwata (University of Tokyo) Submodular Function Minimization ( ) 0 f Assumption: X Minimization Evaluation Algorithm Oracle ( X ) f Minimizer min{ ( ) | } ? f Y Y V

177 views • 16 slides
One-Dimensional Minimization Lectures for PHD course on Numerical optimization Enrico Bertolazzi

One-Dimensional Minimization Lectures for PHD course on Numerical optimization Enrico Bertolazzi

One-Dimensional Minimization Lectures for PHD course on Numerical optimization Enrico Bertolazzi DIMS Universit a di Trento November 21 December 14, 2011 One-Dimensional Minimization 1 / 33 Outline Golden Section minimization 1

654 views • 33 slides
Unit 18 Field Programmable Gate Arrays (FPGAs) HARDWARE IMPLEMENTATION Implementing Logic

Unit 18 Field Programmable Gate Arrays (FPGAs) HARDWARE IMPLEMENTATION Implementing Logic

18.1 18.2 Unit 18 Field Programmable Gate Arrays (FPGAs) HARDWARE IMPLEMENTATION Implementing Logic Functions with Memories TARGETS 18.3 18.4 Processing Logic Approaches Progression of HW Logic Density Recall HW/SW designs sit on a

462 views • 8 slides
The BIST History of FPGAs FPGAs The BIST History of The BISTory BISTory of of FPGAs FPGAs

The BIST History of FPGAs FPGAs The BIST History of The BISTory BISTory of of FPGAs FPGAs

The BIST History of FPGAs FPGAs The BIST History of The BISTory BISTory of of FPGAs FPGAs The Chuck Stroud Chuck Stroud Electrical and Computer Engineering Electrical and Computer Engineering Auburn University Auburn University 1

685 views • 42 slides
High-Speed Computing & Co-Processing with FPGAs FPGAs (Field Programmable Gate Arrays) are

High-Speed Computing & Co-Processing with FPGAs FPGAs (Field Programmable Gate Arrays) are

High-Speed Computing & Co-Processing with FPGAs FPGAs (Field Programmable Gate Arrays) are slowly becoming more and more advanced and practical as high-speed computing platforms. In this talk, David will provide an in-depth introduction into

478 views • 43 slides
Learning as Loss Minimization Machine Learning 1 Learning as loss minimization The setup

Learning as Loss Minimization Machine Learning 1 Learning as loss minimization The setup

Learning as Loss Minimization Machine Learning 1 Learning as loss minimization The setup Examples x drawn from a fixed, unknown distribution D Hidden oracle classifier f labels examples We wish to find a hypothesis h that mimics f

294 views • 25 slides
FPGA What is a FPGA? How FPGAs work How do they work? Manufacturers

FPGA What is a FPGA? How FPGAs work How do they work? Manufacturers

2/21/2012 Content FPGA What is a FPGA? How FPGAs work How do they work? Manufacturers Distributed RAM History FPGA vs ASIC FPGA and Microprocessors Alternatives to FPGAs ETI135, Advanced Digital IC Design

123 views • 10 slides
1 The Minimization Problem The Minimization Problem Input: A DFA (deterministic finite-state

1 The Minimization Problem The Minimization Problem Input: A DFA (deterministic finite-state

Simpler & More General Minimization The Minimization Problem for Weighted Finite-State Automata Input: A DFA (deterministic finite-state automaton) Output: An equiv. DFA with as few states as possible Complexity: O(|arcs| log |states| )

792 views • 16 slides

More recommend