Presentation is loading. Please wait.

Presentation is loading. Please wait.

4/26/05Prasad: ELEC7250 1 PROOFS: A Fault Simulation Algorithm Pratap S.Prasad ELEC 7250 Instructor: Prof. Vishwani Agrawal.

Similar presentations


Presentation on theme: "4/26/05Prasad: ELEC7250 1 PROOFS: A Fault Simulation Algorithm Pratap S.Prasad ELEC 7250 Instructor: Prof. Vishwani Agrawal."— Presentation transcript:

1 4/26/05Prasad: ELEC7250 1 PROOFS: A Fault Simulation Algorithm Pratap S.Prasad ELEC 7250 Instructor: Prof. Vishwani Agrawal

2 Prasad: ELEC72502 4/26/05 Fault Simulation Simulators  Necessity  Strategy Need For :  Speed  Memory Reduction

3 Prasad: ELEC72503 4/26/05 Related Work Fault simulation strategies  Approximate methods Statistical Fault Analysis Critical Path Tracing  Accurate methods Concurrent Deductive Differential Parallel Others

4 Prasad: ELEC72504 4/26/05 PROOFS Algorithm PROOFS : Parallel RestOrative Order-independent Fault Simulator A hybrid of the concurrent, differential, and parallel fault simulation algorithms. For every test vector { Do true-value simulation; for every undetected faulty machine { Give a unique simulation ID; Inject current fault; recover current states; do event-driven simulation; if the fault is detected, drop the fault; }

5 Prasad: ELEC72505 4/26/05 Results PROOFS algorithm was run on many of the ISCAS sequential benchmark circuits A comparison of the two algorithms shows the PROOFS is 6 to 67 times faster than the concurrent algorithm while always requiring less memory. Memory is reduced by up to 7.5 times over the concurrent algorithm Sample Comparisons:

6 Prasad: ELEC72506 4/26/05 Conclusion PROOFS – A very fast fault simulation algorithm The new techniques in PROOFS are:  Use of group-id to avoid the overhead of restoring the good values after each fault propagation  Concept of active and inactive faults to prevent eventless fault simulation  Efficient method of fault injection by circuit modification  An efficient fault ordering to minimize events in word parallel operations. It has been shown that this algorithm is 6.6 to 67 times faster than a state of the art concurrent fault simulator while also requiring much less memory.

7 Prasad: ELEC72507 4/26/05 References M.L.Bushnell and V.D.Agrawal,”’Essentials of Electronic Testing for Digital, Memory and Mixed-Signal VLSI circuits”’ Kluwer Academic Publishers., 2000 M.Abramovici, M.A.Breuer, A.D.Friedman,”’Digital Systems Testing and Testable Design”’, IEEE Press, 1995. W.-T.Cheng and J.H.Patel, PROOFS: A super fast simulator for sequential circuits, Design Automation Conference, Mar. 1990. T.M.Niermann, Wu-Tung Cheng and J.H. Patel”’Proofs: a fast, memory efficient sequential circuit fault simulator”’, Proceedings of the 27 th ACM/IEEE conference on Design automation, pp. 535 - 540, 1991


Download ppt "4/26/05Prasad: ELEC7250 1 PROOFS: A Fault Simulation Algorithm Pratap S.Prasad ELEC 7250 Instructor: Prof. Vishwani Agrawal."

Similar presentations


Ads by Google