190 likes | 335 Views
RALF: Reliability Analysis for Logic Faults – An Exact Algorithm and its Applications. Samuel Luckenbill 1 , Ju-Yueh Lee 2 , Yu Hu 3 , Rupak Majumdar 1 , and Lei He 2 1 Computer Science Dept., UCLA 2 Electrical Engineering Dept., UCLA
E N D
RALF: Reliability Analysis for Logic Faults – An Exact Algorithm and its Applications Samuel Luckenbill1, Ju-Yueh Lee2, Yu Hu3, Rupak Majumdar1, and Lei He2 1Computer Science Dept., UCLA 2Electrical Engineering Dept., UCLA 3Electrical Engineering Dept., University of Alberta, Edmonton Canada
Outline • RALF Overview • Circuit Representation • Algorithms • Experimental results
RALF Features • Single-gate criticality: The probability that a flipped bit at one gate will affect the output • Full-chip fault rate: The average criticality over all gates in a circuit
Applications for RALF • Circuit optimization for reliability • Random pattern-resistant fault identification to enhance testability • Optimality studies of approximate algorithms
RALF System • Exact symbolic algorithm • Compiles miter to d-DNNF (similar to BDD) • Computes criticality in one pass over d-DNNF Miter Circuit CNF d-DNNF Fault Rate
Miter-Based Calculation Criticality of G: Fraction of assignments to primary inputs Xi for which O = 1
Compiled Circuit Representation • Deterministic Decomposable Negation Normal Form (d-DNNF) • A subset of NNF which satisfies • Decomposability • Determinism
Why d-DNNF? • Almost as powerful as BDD • Polytime operations include SAT, model counting, and model enumeration • Usually more concise than BDD and faster to compile • Determinism and decomposability make the criticality computation efficient • Compiler: http://reasoning.cs.ucla.edu/c2d
or and and or or or or and and and and and and and and A B B A C D D C Negation Normal Form
Decomposability No two children of AND share a variable or and and A,B C,D or or or or and and and and and and and and A B B A C D D C
Determinism No two children of OR share a satisfying assignment or and and or or or or and and and and and and and and A B B A C D D C
Criticality Algorithm • d-DNNF is a representation of the miter • Invariant: at each node, we compute the probability that the circuit below it evaluates to 1 • Value computed at root is the criticality of the faulty node in the miter • Computation is linear in d-DNNF size
Evaluating d-DNNF (e.g. 0.5 for a uniform distribution over the inputs) L Pr(L) 1 - Pr(L) L AND Pr(AND) = Pr(α) * Pr(β)(Requires Decomposability) α β OR Pr(OR) = Pr(α) + Pr(β) (Requires Determinism) α β
Random-Pattern Resistant Faults Fault Logic Masking
Conclusion • RALF performs surprisingly well on MCNC circuits, despite being an exact algorithm • RALF uses d-DNNF, a less powerful but usually more succinct circuit representation than BDD. • For criticality and fault-rate computation, Monte Carlo simulation is good enough for most circuits