Overview. Usages of Fault Simulators. Problem and Motivation. Alternatives and Their Limitations. VLSI Design Verification and Testing

Similar documents
EE1000 Project 4 Digital Volt Meter

CS September 2018

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Walk Like a Mathematician Learning Task:

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Floating Point Number System -(1.3)

Floating Point Number System -(1.3)

Present state Next state Q + M N

QUESTIONS BEGIN HERE!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

QUESTIONS BEGIN HERE!

1 Introduction to Modulo 7 Arithmetic

Designing A Concrete Arch Bridge

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Seven-Segment Display Driver

Section 3: Antiderivatives of Formulas

VLSI Testing Assignment 2

Minimum Spanning Trees

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Chem 104A, Fall 2016, Midterm 1 Key

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

Instructions for Section 1

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Problem solving by search

Outline. Binary Tree

Yehuda Lindell Bar-Ilan University

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Last time: introduced our first computational model the DFA.

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Compression. Compression. Compression. This part of the course... Ifi, UiO Norsk Regnesentral Vårsemester 2005 Wolfgang Leister

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Limits Indeterminate Forms and L Hospital s Rule

CIVL 8/ D Boundary Value Problems - Rectangular Elements 1/7

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

Winter 2016 COMP-250: Introduction to Computer Science. Lecture 23, April 5, 2016

Experiment # 3 Introduction to Digital Logic Simulation and Xilinx Schematic Editor

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

( ) Geometric Operations and Morphing. Geometric Transformation. Forward v.s. Inverse Mapping. I (x,y ) Image Processing - Lesson 4 IDC-CG 1

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Multipoint Alternate Marking method for passive and hybrid performance monitoring

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)

Ch 1.2: Solutions of Some Differential Equations

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

First derivative analysis

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

12. Traffic engineering

Kernels. ffl A kernel K is a function of two objects, for example, two sentence/tree pairs (x1; y1) and (x2; y2)

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Constructive Geometric Constraint Solving

0.1. Exercise 1: the distances between four points in a graph

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Nefertiti. Echoes of. Regal components evoke visions of the past MULTIPLE STITCHES. designed by Helena Tang-Lim

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

How much air is required by the people in this lecture theatre during this lecture?

TOPIC 5: INTEGRATION

u x v x dx u x v x v x u x dx d u x v x u x v x dx u x v x dx Integration by Parts Formula

Planar Upward Drawings

IEEE ASIC/SOC Conference, September 2000, Washington, D.C.

DFA (Deterministic Finite Automata) q a

Multiple Short Term Infusion Homework # 5 PHA 5127

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

COMP108 Algorithmic Foundations

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Finite Automata. d: Q S Q. Finite automaton is M=(Q, S, d, q 0, F) Ex: an FA that accepts all odd-length strings of zeros: q 0 q 1. q i. q k.

Slide 1. Slide 2. Slide 3 DIGITAL SIGNAL PROCESSING CLASSIFICATION OF SIGNALS

, between the vertical lines x a and x b. Given a demand curve, having price as a function of quantity, p f (x) at height k is the curve f ( x,

I. The Connection between Spectroscopy and Quantum Mechanics

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

ME 321 Kinematics and Dynamics of Machines S. Lambert Winter 2002

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

CONTINUITY AND DIFFERENTIABILITY

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

(a) v 1. v a. v i. v s. (b)

Chapter 3 Fourier Series Representation of Periodic Signals

Propositional Logic. Combinatorial Problem Solving (CPS) Albert Oliveras Enric Rodríguez-Carbonell. May 17, 2018

Continuous Random Variables: Basics

The Course covers: Lexical Analysis Syntax Analysis Semantic Analysis Runtime environments Code Generation Code Optimization. CS 540 Spring 2013 GMU 2

CSI35 Chapter 11 Review

Push trolley capacities from 1 2 through 10 Ton Geared trolley capacities from 1 2 through 100 Ton

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

Decimals DECIMALS.

Aquauno Video 6 Plus Page 1

Errata for Second Edition, First Printing

Transcription:

VLSI Dsin Vriiction n Tstin Fult Simultion Mohmm Thrnipoor Elctricl n Computr Eninrin Univrsity o Conncticut Ovrviw Prolm n motivtion Fult simultion lorithms Sril Prlll Ductiv Concurrnt Othr lorithms Rnom Fult Smplin Summry Prolm n Motivtion Fult simultion Prolm: Givn A circuit A squnc o tst vctors A ult mol Dtrmin Fult covr - rction (or prcnt) o mol ults tct y tst vctors St o untct ults Motivtion Dtrmin tst qulity n in turn prouct qulity Fin untct ult trts to improv tsts Uss o Fult Simultors Tst rin s xplin or Tst Gnrtion Fult inosis Dsin or tst (DFT) intiiction o points tht my hlp improv tst qulity known s Tst Point Insrtion Fult-tolrnc intiiction o m ult cn cus Altrntivs n Thir Limittions Fult Simultor in VLSI Dsin Procss Prototypin with ult injction cpilitis Costly Limit ult injction cpility Dsin chns hr to implmnt Lon l tim Hrwr multors Costly Rquir spcil hrwr Mol ult list Fult Low covr? Aqut Stop Vrii sin ntlist Fult simultor Rmov tst ults Tst nrtor Tst Dlt compctor vctors A vctors Vriiction input stimuli Tst vctors 6

Exmpl Exmpl Hl-Ar HA c C A B C A B FA FA S S Full-Ar A B C HA D E HA F Crry Sum C A B C A B FA FA S S C 7 8 Fult Simultion Rsults Fult Simultion Scnrio -it FA: 6 loic ts, 9 PIs, POs, 86 sinl stuck-t ults. Vctor Numr 6 7 8 86 Uncollps Fults Dtct 6 6 86 86 86 Covr % 6% 67% 77% 87% % % % Collps Fults Dtct 7 6 77 89 Covr % 7% 68% 78% 89% % % % Circuit mol: mix-lvl Mostly loic with som switch-lvl or hih-impnc (Z) n iirctionl sinls Hih-lvl mols (mmory, tc.) with pin ults Sinl stts: loic Two (, ) or thr (,, X) stts or purly Booln loic circuits Four stts (,, X, Z) or squntil MOS circuits Timin: Zro-ly or comintionl n synchronous circuits Mostly unit-ly or circuits with ck 9 Fult Simultion Scnrio (cont.) Fult Simultion Alorithms Fults: Mostly sinl stuck-t ults Somtims stuck-opn, trnsition, n pth-ly ults; nlo circuit ult simultors r not yt in common us Equivlnc ult collpsin o sinl stuck-t ults Fult-roppin -- ult onc tct is ropp rom consirtion s mor vctors r simult; ultroppin my supprss or inosis Fult smplin -- rnom smpl o ults is simult whn th circuit is lr Sril Prlll Ductiv Concurrnt Othrs Dirntil Prlll pttrn tc.

Sril Alorithm Fult Injction Alorithm: Simult ult-r circuit n sv rsponss. Rpt ollowin stps or ch ult in th ult list: Moiy ntlist y injctin on ult Simult moii ntlist, vctor y vctor, comprin rsponss with sv rsponss I rspons irs, rport ult tction n suspn simultion o rminin vctors Avnts: Esy to implmnt; ns only tru-vlu simultor, lss mmory Most ults, incluin nlo ults, cn simult Moiyin ntlist or vry run cn xpnsiv Altrntiv Chck i nt is ulty or ult-r I ulty chn its vlu to th stuck-vlu Els lv it to th comput vlu Mux s ult insrtion Us itionl vrils n comput th vlu s on th sinl vlu n th vlu in th itionl vril Sril Alorithm (Cont.) Prlll Fult Simultion Disvnt: Much rpt computtion; CPU tim prohiitiv or VLSI circuits Altrntiv: Simult mny ults tothr Tst vctors Fult-r circuit Circuit with ult Circuit with ult Comprtor Comprtor Comprtor tct? tct? n tct? Compil-co mtho; st with two-stts (,) Exploits inhrnt it-prlllism o loic oprtions on computr wors Stor: on wor pr lin or two-stt simultion Multi-pss simultion: Ech pss simults w- nw ults, whr w is th mchin wor lnth Sp up ovr sril mtho ~ w- Not suitl or circuits with timin-criticl n non- Booln loic Circuit with ult n 6 Prlll Fult Sim. Exmpl Ductiv Fult Simultion Bit : ult-r circuit Bit : circuit with c s-- Bit : circuit with s-- c s-- s-- Input = c s-- tct On-pss simultion, on ult-r circuit is simult. Ech lin k contins list L k o ults tctl on k Followin tru-vlu simultion o ch vctor, ult lists o ll t output lins r upt usin stthortic ruls, sinl vlus, n t input ult lists PO ult lists provi tction t Limittions: St-thortic ruls iicult to riv or non-booln ts Gt lys r iicult to us 7 8

Ductiv Fult Sim. Exmpl Nottion: L k is ult list or lin k k n is s--n ult on lin k { } {, c } { } c {, } L = L U L c U { } = {,, c, } {,, } L = (L L ) U { } = {, c,, } U Fults tct y th input vctor S Tl.6 in P (txt ook) or ult list proption ruls Concurrnt Fult Simultion Evnt-rivn simultion o ult-r circuit n only thos prts o th ulty circuit tht ir in sinl stts rom th ult-r circuit. A list pr t continin copis o th t rom ll ulty circuits in which this t irs. List lmnt contins ult ID, t input n output vlus n intrnl stts, i ny. All vnts o ult-r n ll ulty circuits r implicitly simult. Fults cn simult in ny molin styl or til support in tru-vlu simultion (ors most lxiility.) Fstr thn othr mthos, ut uss most mmory. 9 Conc. Fult Sim. Exmpl Othr Fult Simultion Alorithms c c c Prlll pttrn sinl ult simultion (PPSFP) Simult mny vctors in prlll Injct only on ult hnc on vnt Simult th circuit rom th ult sit Limittion wll suit or comintionl circuits only Fult Smplin Motivtion or Smplin A rnomly slct sust (smpl) o ults is simult. Msur covr in th smpl is us to stimt ult covr in th ntir circuit. Avnt: Svin in computin rsourcs (CPU tim n mmory.) Disvnt: Limit t on untct ults. Complxity o ult simultion pns on: Numr o ts Numr o ults Numr o vctors Complxity o ult simultion with ult smplin pns on: Numr o ts Numr o vctors

Rnom Smplin Mol All ults with ix ut unknown covr N p = totl numr o ults (popultion siz) Rnom pickin C = ult covr (unknown) Dtct ult Untct ult = smpl siz << N p c = smpl covr ( rnom vril) Proility Dnsity o Smpl Covr, c p (x ) (x--c ) -- ------------ σ p (x ) = Pro(x < c < x +x ) = -------------- σ ( ( π) / C ( - C) Vrinc,, σ = ------------ σ Mn = C σ Smplin rror C -σ C x C +σ. Smpl covr Gussin Proility nsity o smpl ult covr c x 6 Smplin Error Bouns C ( - C ) x - C = [ -------------- ] / Solvin th qurtic qution or C, w t th -sim (99.7% coninc) stimt:. C σ = x ± ------- [ +. x ( - x )]/ Whr is smpl siz n x is th msur ult covr in th smpl. Exmpl: A circuit with 9,96 ults hs n ctul ult covr o 87.%. Th msur covr in rnom smpl o, ults is 88.7%. Th ov ormul ivs n stimt o 88.7% ± %. CPU tim or smpl simultion ws out % o tht or ll ults. 7