Design of Reliable Processors Based on Unreliable Devices Séminaire COMELEC
|
|
- Christina Simpson
- 6 years ago
- Views:
Transcription
1 Design of Reliable Processors Based on Unreliable Devices Séminaire COMELEC Lirida Alves de Barros Naviner Paris, 1 July 213
2 Outline Basics on reliability Technology Aspects Design for Reliability Conclusions 2 /33 COMELEC Lirida Naviner Paris, June 213
3 What is Reliability? Reliability is the ability of a system or component to perform its reuired functions under stated conditions for a specified period of time. 3 /33 COMELEC Lirida Naviner Paris, June 213
4 What is Reliability? Reliability is the ability of a system or component to perform its reuired functions under stated conditions for a specified period of time. 3 /33 COMELEC Lirida Naviner Paris, June 213
5 When is Reliability Important? Safety critical applications Biomedical Transport Spatial Energy Security... But today also for Computer Communications Consumer 4 /33 COMELEC Lirida Naviner Paris, June 213
6 Is the Electronics Reliable? Radiations Shocks (mechanical, temperature) HW/SW system inputs Unexpected conditions of use Design errors Software failures Defects Process variation Ageing Noise Malicious attacks Human errors expected outputs Performance Power Data integrity Availability Security 5 /33 COMELEC Lirida Naviner Paris, June 213
7 Advances in CMOS Moore s law (popular form) : 2 N tr /mm 2 every 18 months Intel 44 (1971) : 1µm and tr Intel Xeon Phi (212) : 22nm and tr 6 /33 COMELEC Lirida Naviner Paris, June 213
8 More Moore Scaling issues Design complexity, test challenge, low power voltage Variability Modelling Sensitivity to unscaled environmental disturbances Scaling effects Yield decrease Reliability decrease 7 /33 COMELEC Lirida Naviner Paris, June 213
9 Scaling and Reliability ageing, single and multiple transient faults 8 /33 COMELEC Lirida Naviner Paris, June 213
10 Fault Propagation 9 /33 COMELEC Lirida Naviner Paris, June 213
11 Bathtub Curve 1 /33 COMELEC Lirida Naviner Paris, June 213
12 Some Metrics Mean Time To Failures MTTF Mean Time To Repair MTTR Mean Time Between Failures MTBF Failures In Time FIT Failure Rate R = e Time MTBF R = Prob(exact) 11 /33 COMELEC Lirida Naviner Paris, June 213
13 Research at Telecom ParisTech How to get optimized design of processors? 12 /33 COMELEC Lirida Naviner Paris, June 213
14 Research at Telecom ParisTech How to get optimized design of reliable processors based on unreliable devices? Risk minimization More (than) Moore Fabless generalization Reliability improvement penalties! 12 /33 COMELEC Lirida Naviner Paris, June 213
15 Masking Effects Reliability assessment! 13 /33 COMELEC Lirida Naviner Paris, June 213
16 Hardware Fault Injection 14 /33 COMELEC Lirida Naviner Paris, June 213
17 Probabilistic Transfer Matrices (PTM) inputs a b outputs IT M OR R OR = inputs z outputs P T M OR inputs outputs a bc R XOR3 = inputs z outputs IT M XOR3 P T M XOR3 [1] S. Krishnaswamy, G.F Viamontes, I.L. Markov, I.L and J.P Hayes, Accurate reliability evaluation and enhancement via probabilistic transfer matrices, DATE /33 COMELEC Lirida Naviner Paris, June 213
18 PTM Computation A B C A Level 1 (L1) B C Level 1 (L1) Level 2 (L2) Level 2 (L2) PTM = PTM PTM L1 AND NOT PTM = PTM PTM L1 AND NOT p p p S PTM p p NOT = p PTM AND = PTM NOR p p = p p p p S PTM p NOT = p PTM AND = PTM NOR p = p p p p 2 p 2 p p p p 2 p p p 2 p p p 2 p 2 p p p p p p 2 p 2 p 2 p p p 2 = p p = p p p 2 p 2 p p 2 p p p 2 p p p p 2 p p p p 2 p 2 2 p p p p p p p 2 2 p p p 2 p 2 = p p p p = p pp 2 p p 2 p 2 p p p 2 p p p 2 p p p p 2 p p 2 p p p p 2 2 p p p p p 16 /33 COMELEC Lirida Naviner Paris, June 213
19 PTM Computation A B C Level 1 (L1) Level 2 (L2) p p S PTM p NOT = p PTM AND = PTM NOR p = p p p p p p p p p p 2 p p p 2 p p p 2 p p p p p 2 p p 2 p 2 p 2p 2 + p p 2 + 2p 2 + p 3 p p 2 p p p 2 PTM = PTM PTM 2 p p = p 2 = p 2 + 3p 2 L1 AND NOT p p p p p 2 2p 2 + p 3+ 3 p p 2 p 2 p p p p 2p p p p p p p 2 + p 3 2 p p p 2 p p p 2 p p p + 3p 2 p p 2 2p 2 + p 3+ 3 PTM CIR = PTM L1 PTM NOR = p 2 p 2 = p p p 2 2 p 2p p + p p p p 2 + 2p 2 + p 3 2 p p p 2 p p 2 + 3p 2 2p 2 + p 3+ 3 p 2 p p 2 2p 2 + p p 2 + p 2 p p 2 2 p 2p 2 + p p 2 + 2p 2 + p 3 16 /33 COMELEC Lirida Naviner Paris, June 213
20 Reliability Calculation with PTM R cir = p(j i)p(i) ITM cir (i,j)=1 p(i) is the probability of input value i p(j i) is the (i, j)th element in PTM cir 2p 2 + p p 2 + 3p 2 1 2p 2 + p ITM CIR = 1 p 2 + 3p 2 PTM CIR = 1 2p 2 + p p 2 + 3p 2 1 2p 2 + p p 2 + p p 2 + 2p 2 + p 3 2p 2 + p 3+ 3 p 2 + 2p 2 + p 3 2p 2 + p 3+ 3 p 2 + 2p 2 + p 3 2p 2 + p p 2 + p 2 p 2 + 2p 2 + p 3 17 /33 COMELEC Lirida Naviner Paris, June 213
21 Signal Probability and Reliability (SPR) [ c 1 S = i i 1 c ] SPR S = [ p(s = c ) p(s = 1 i ) p(s = i ) p(s = 1 c ) ] [ s s = 1 s 2 s 3 ] R S = p(s = c ) + p(s = 1 c ) = s + s 3 [1] D. Franco, M. Vasconcelos, L. Naviner et J.-F. Naviner, Signal Probability for Reliability Evaluation of Logic Circuits, Microelectronics Reliability Journal, Septembre 28, vol. 48, pp /33 COMELEC Lirida Naviner Paris, June 213
22 Signal Reliability Propagation A 4 = B 4 = NAND =.92 a y b y IT M NAND y I NAND = A 4 B P T M NAND = p(y) Y /33 COMELEC Lirida Naviner Paris, June 213
23 Reconvergent Signals a = b A 4 = B 4 = a a 3 b b 3 a b circuit R NOT = y() y(1) Y () 4 = Y (1) 4 = a 3 a b 3 b a 3 a b 3 b R(circuit) = R y() R y(1) = a 3 b a 3 b 2 + a b a b 2 2 /33 COMELEC Lirida Naviner Paris, June 213
24 Multipath SPR P ass 1 : 1 A 4 = circuit a R NOT = y() y(1) Y () 4 = Y (1) 4 = R(circuit, a ) = R y() R y(1) a = a 2 P ass 2 : A 4 = 1 a circuit R NOT = y() y(1) Y () 4 = Y (1) 4 = R(circuit, a 3 ) = R y() R y(1) a 3 = a 3 2 R(circuit) = R(circuit, a ) + R(circuit, a 3 ) = a 2 + a /33 COMELEC Lirida Naviner Paris, June 213
25 Multipath SPR A G1 D G3 B S C E G2 SPR Di = ITM G1 (SPR A SPR Bi ) PTM G1 (1) SPR Ei = ITM G2 (SPR Bi SPR C ) PTM G2 (2) SPR Si = ITM G3 (SPR Di SPR Ei ) PTM G3 (3) 4 SPR S = SPR Si w i (4) i=1 [1] D. Teixeira Franco, M. Rabelo de Vasconcelos, L. A. B. de Naviner, and J. cois Naviner, "A Tool for Signal Reliability Analysis of Logic Circuits," DATE 9 22 /33 COMELEC Lirida Naviner Paris, June 213
26 Conditional Probability I1 B1 Z1 S I2 B2 Z2 p(z 1 = i) = f 1(S, I1, B1) p(z 1 = i S = k) = f 1(I1, B1) p(z 2 = j) = f 2(S, I2, B2) p(z 2 = j S = k) = f 2(I2, B2) 23 /33 COMELEC Lirida Naviner Paris, June 213
27 Conditional Probability A c i 1i 1c B B B B c i 1i 1c c i 1i 1c c i 1i 1c c i 1i 1c G G G G G G G G G G G G G G G G c 1i i 1c 1i c 1c i i 1c c 1i 1c i 1i c 1i c 1c i c 1i i 1c 1c i 1i c i 1c 1i c p(z A1) p(z A2) p(z A3) p(z A4) Logic XOR 24 /33 COMELEC Lirida Naviner Paris, June 213
28 Conditional Probability Matrices (CPM) CPM Z = p(z 1 /a 1 ) p(z 1 /a 2 ) p(z 1 /a 3 ) p(z 1 /a 4 ) p(z 2 /a 1 ) p(z 2 /a 2 ) p(z 2 /a 3 ) p(z 2 /a 4 ) p(z 3 /a 1 ) p(z 3 /a 2 ) p(z 3 /a 3 ) p(z 3 /a 4 ) p(z 4 /a 1 ) p(z 4 /a 2 ) p(z 4 /a 3 ) p(z 4 /a 4 ) [1] J. Torras Flauer, J.-M. Daveau, L. Naviner and Ph. Roche, Handling reconvergent paths using conditional probabilities in combinatorial logic netlists reliability estimation, IEEE ICECS /33 COMELEC Lirida Naviner Paris, June 213
29 Conditional Probability Matrices (CPM) CPM Y = p(y 1 /s sn 1 )... p(y 1/s sn 4 ) p(y 2 /s sn 1 )... p(y 1/s sn 4 ) p(y 3 /s sn 1 )... p(y 1/s sn 4 ) p(y 4 /s sn 1 )... p(y 1/s sn 4 ) [1] J. Torras Flauer, J.-M. Daveau, L. Naviner and Ph. Roche, Handling reconvergent paths using conditional probabilities in combinatorial logic netlists reliability estimation, IEEE ICECS /33 COMELEC Lirida Naviner Paris, June 213
30 Reliability based on CPM A B P G C D P1 G1 PM GN X Y Gout Z SPR Z = ITM T G out M XY PTM T G out M N CPM X/A B = CPM Pi CPM Y /A B = CPM Gj i= i= 4 4 p(x i y j ) = p(x i /a k b l ) p(y j /a k b l ) p(a k ) p(b j ) k=1 l=1 26 /33 COMELEC Lirida Naviner Paris, June 213
31 Probabilistic Binomial Reliability Model R = 2 n e 1 j= fault free i faulty 2 n x 1 ( ) (1 i ) p(x i ) y(x i, e ) y(x i, e j ) i= Logical masking features Technology/profile aspects Relevant faults Relevant input vectors n m x generic logic circuit y [1] M. Correia De Vasconcelos, D. Teixeira Franco, L. Alves de Barros Naviner and J. F. Naviner, Reliability Analysis of Combinational Circuits Based on a Probabilistic Binomial Model, IEEE-NEWCAS and TAISA Conference, Montréal, Canada, June /33 COMELEC Lirida Naviner Paris, June 213
32 Probabilistic Binomial Reliability Model R = 2 n e 1 j= fault free i faulty 2 n x 1 ( ) (1 i ) p(x i ) y(x i, e ) y(x i, e j ) i= Logical masking features Technology/profile aspects Relevant faults Relevant input vectors n m x generic logic circuit y [1] M. Correia De Vasconcelos, D. Teixeira Franco, L. Alves de Barros Naviner and J. F. Naviner, Reliability Analysis of Combinational Circuits Based on a Probabilistic Binomial Model, IEEE-NEWCAS and TAISA Conference, Montréal, Canada, June /33 COMELEC Lirida Naviner Paris, June 213
33 Probabilistic Binomial Reliability Model R = 2 n e 1 j= fault free i faulty 2 n x 1 ( ) (1 i ) p(x i ) y(x i, e ) y(x i, e j ) i= Logical masking features Technology/profile aspects Relevant faults Relevant input vectors n m x generic logic circuit y [1] M. Correia De Vasconcelos, D. Teixeira Franco, L. Alves de Barros Naviner and J. F. Naviner, Reliability Analysis of Combinational Circuits Based on a Probabilistic Binomial Model, IEEE-NEWCAS and TAISA Conference, Montréal, Canada, June /33 COMELEC Lirida Naviner Paris, June 213
34 Probabilistic Binomial Reliability Model R = 2 n e 1 j= fault free i faulty 2 n x 1 ( ) (1 i ) p(x i ) y(x i, e ) y(x i, e j ) i= Logical masking features Technology/profile aspects Relevant faults Relevant input vectors n m x generic logic circuit y [1] M. Correia De Vasconcelos, D. Teixeira Franco, L. Alves de Barros Naviner and J. F. Naviner, Reliability Analysis of Combinational Circuits Based on a Probabilistic Binomial Model, IEEE-NEWCAS and TAISA Conference, Montréal, Canada, June /33 COMELEC Lirida Naviner Paris, June 213
35 Probabilistic Binomial Reliability Model R = 2 n e 1 j= fault free i faulty 2 n x 1 ( ) (1 i ) p(x i ) y(x i, e ) y(x i, e j ) i= Logical masking features Technology/profile aspects Relevant faults Relevant input vectors n m x generic logic circuit y [1] M. Correia De Vasconcelos, D. Teixeira Franco, L. Alves de Barros Naviner and J. F. Naviner, Reliability Analysis of Combinational Circuits Based on a Probabilistic Binomial Model, IEEE-NEWCAS and TAISA Conference, Montréal, Canada, June /33 COMELEC Lirida Naviner Paris, June 213
36 PBR Implementation Simulate (or emulate) errors and then compare outputs FIFA : Fault-Injection Fault-Analysis platform [1,2] Acceleration of fault injection and functional simulation input generation n inputs n inputs n fault free circuit fault prone circuit outputs m outputs m comparison coefficients storage fault generation G [1] E. Marues, N. Maciel, L. Naviner and J. F. Naviner, A New Fault Generator Suitable for Reliability Analysis of Digital Circuits, IEEE CUMTA 1. [2] L. Alves de Barros Naviner, J. F. Naviner, G. Gonçalves dos Santos Jr, E. Crespo Marues and N. Maciel, FIFA : A Fault-Injection-Fault-Analysis-based tool for reliability assessment at RTL level, ES- REF /33 COMELEC Lirida Naviner Paris, June 213
37 SNAP Approach Fault source and fault propagation input output input (a) output ifs analysis gf = 1 ofs (b) ofs = f (ifs, gf, input, gate) [1] S. Pagliarini, A. Ben Dhia, L. Naviner and J. F. Naviner, SNaP : a Novel Hybrid Method for Circuit Reliability Assessment Under Multiple Faults, ESREF /33 COMELEC Lirida Naviner Paris, June 213
38 Reliability Calculation based on SNAP R = ofs inputa inputb output (a) inputa ifsa inputb ifsb analysis gf = 1 analysis gf = 1 (b) analysis gf = 2 output ofs 3 /33 COMELEC Lirida Naviner Paris, June 213
39 Comparisons Accuracy Complexity Trade-off FPGA PTM - - SPR - - SPR-MP Yes - CPM Yes - PBR Yes Yes SNAP - Yes 31 /33 COMELEC Lirida Naviner Paris, June 213
40 Conclusions Reliability issues and challenges Need of cost-effective fault tolerant architectures Need of efficient assessment approaches Some Telecom ParisTech contributions (models, methods and tools) SPR, SPR-MP, CPM, SPR-DWAA PBR, FIFA, SNAP, /33 COMELEC Lirida Naviner Paris, June 213
41 Conclusions Reliability issues and challenges Need of cost-effective fault tolerant architectures Need of efficient assessment approaches Some Telecom ParisTech contributions (models, methods and tools) SPR, SPR-MP, CPM, SPR-DWAA PBR, FIFA, SNAP, /33 COMELEC Lirida Naviner Paris, June 213
42 To know more about... Contact : Visit : Prof. Lirida A. B. Naviner lirida.naviner@telecom-paristech.fr http ://nanoelec.wp.mines-telecom.fr 33 /33 COMELEC Lirida Naviner Paris, June 213
Error Threshold for Individual Faulty Gates Using Probabilistic Transfer Matrix (PTM)
Available online at www.sciencedirect.com ScienceDirect AASRI Procedia 9 (2014 ) 138 145 2014 AASRI Conference on Circuits and Signal Processing (CSP 2014) Error Threshold for Individual Faulty Gates Using
More informationQuantitative evaluation of Dependability
Quantitative evaluation of Dependability 1 Quantitative evaluation of Dependability Faults are the cause of errors and failures. Does the arrival time of faults fit a probability distribution? If so, what
More informationFault Tolerance. Dealing with Faults
Fault Tolerance Real-time computing systems must be fault-tolerant: they must be able to continue operating despite the failure of a limited subset of their hardware or software. They must also allow graceful
More informationUNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Fault Tolerant Computing ECE 655
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Fault Tolerant Computing ECE 655 Part 1 Introduction C. M. Krishna Fall 2006 ECE655/Krishna Part.1.1 Prerequisites Basic courses in
More informationTerminology and Concepts
Terminology and Concepts Prof. Naga Kandasamy 1 Goals of Fault Tolerance Dependability is an umbrella term encompassing the concepts of reliability, availability, performability, safety, and testability.
More informationReliable Computing I
Instructor: Mehdi Tahoori Reliable Computing I Lecture 5: Reliability Evaluation INSTITUTE OF COMPUTER ENGINEERING (ITEC) CHAIR FOR DEPENDABLE NANO COMPUTING (CDNC) National Research Center of the Helmholtz
More informationLecture 5 Fault Modeling
Lecture 5 Fault Modeling Why model faults? Some real defects in VLSI and PCB Common fault models Stuck-at faults Single stuck-at faults Fault equivalence Fault dominance and checkpoint theorem Classes
More informationMulti-State Availability Modeling in Practice
Multi-State Availability Modeling in Practice Kishor S. Trivedi, Dong Seong Kim, Xiaoyan Yin Depart ment of Electrical and Computer Engineering, Duke University, Durham, NC 27708 USA kst@ee.duke.edu, {dk76,
More informationQuantitative evaluation of Dependability
Quantitative evaluation of Dependability 1 Quantitative evaluation of Dependability Faults are the cause of errors and failures. Does the arrival time of faults fit a probability distribution? If so, what
More informationSynthesis of Quantum Circuit for FULL ADDER Using KHAN Gate
Synthesis of Quantum Circuit for FULL ADDER Using KHAN Gate Madhumita Mazumder West Bengal University of Technology, West Bengal ABSTRACT Reversible and Quantum logic circuits have more advantages than
More informationTestability. Shaahin Hessabi. Sharif University of Technology. Adapted from the presentation prepared by book authors.
Testability Lecture 6: Logic Simulation Shaahin Hessabi Department of Computer Engineering Sharif University of Technology Adapted from the presentation prepared by book authors Slide 1 of 27 Outline What
More informationDesign for Manufacturability and Power Estimation. Physical issues verification (DSM)
Design for Manufacturability and Power Estimation Lecture 25 Alessandra Nardi Thanks to Prof. Jan Rabaey and Prof. K. Keutzer Physical issues verification (DSM) Interconnects Signal Integrity P/G integrity
More informationOutput Probability Density Functions of Logic Circuits: Modeling and Fault-Tolerance Evaluation
Output Probability Density Functions of Logic Circuits: Modeling and Fault-Tolerance Evaluation Milos Stanisavljevic, Alexandre Schmid and Yusuf Leblebici Microelectronic Systems Laboratory, EPFL, CH-5
More informationFault Tolerant Computing CS 530 Fault Modeling
CS 53 Fault Modeling Yashwant K. Malaiya Colorado State University Fault Modeling Why fault modeling? Stuck-at / fault model The single fault assumption Bridging and delay faults MOS transistors and CMOS
More informationEECS 579: Logic and Fault Simulation. Simulation
EECS 579: Logic and Fault Simulation Simulation: Use of computer software models to verify correctness Fault Simulation: Use of simulation for fault analysis and ATPG Circuit description Input data for
More informationReliability Modeling of Nanoelectronic Circuits
Reliability odeling of Nanoelectronic Circuits Jie Han, Erin Taylor, Jianbo Gao and José Fortes Department of Electrical and Computer Engineering, University of Florida Gainesville, Florida 6-600, USA.
More informationEvaluation criteria for reliability in computer systems
Journal of Electrical and Electronic Engineering 5; 3(-): 83-87 Published online February, 5 (http://www.sciencepublishinggroup.com/j/jeee) doi:.648/j.jeee.s.53.8 ISSN: 39-63 (Print); ISSN: 39-65 (Online)
More informationTradeoff between Reliability and Power Management
Tradeoff between Reliability and Power Management 9/1/2005 FORGE Lee, Kyoungwoo Contents 1. Overview of relationship between reliability and power management 2. Dakai Zhu, Rami Melhem and Daniel Moss e,
More informationFloating Point Representation and Digital Logic. Lecture 11 CS301
Floating Point Representation and Digital Logic Lecture 11 CS301 Administrative Daily Review of today s lecture w Due tomorrow (10/4) at 8am Lab #3 due Friday (9/7) 1:29pm HW #5 assigned w Due Monday 10/8
More informationStochastic Computing: A Design Sciences Approach to Moore s Law
Stochastic Computing: A Design Sciences Approach to Moore s Law Naresh Shanbhag Department of Electrical and Computer Engineering Coordinated Science Laboratory University of Illinois at Urbana Champaign
More informationReliability of probabilistic circuits
Reliability of probabilistic circuits Kaikai Liu To cite this version: Kaikai Liu. Reliability of probabilistic circuits. Engineering Sciences [physics]. TELECOM ParisTech, 2014. English.
More informationVLSI Design I. Defect Mechanisms and Fault Models
VLSI Design I Defect Mechanisms and Fault Models He s dead Jim... Overview Defects Fault models Goal: You know the difference between design and fabrication defects. You know sources of defects and you
More informationEE241 - Spring 2001 Advanced Digital Integrated Circuits
EE241 - Spring 21 Advanced Digital Integrated Circuits Lecture 12 Low Power Design Self-Resetting Logic Signals are pulses, not levels 1 Self-Resetting Logic Sense-Amplifying Logic Matsui, JSSC 12/94 2
More informationChapter 2 Fault Modeling
Chapter 2 Fault Modeling Jin-Fu Li Advanced Reliable Systems (ARES) Lab. Department of Electrical Engineering National Central University Jungli, Taiwan Outline Why Model Faults? Fault Models (Faults)
More informationFault Tolerant Computing CS 530 Fault Modeling. Yashwant K. Malaiya Colorado State University
CS 530 Fault Modeling Yashwant K. Malaiya Colorado State University 1 Objectives The number of potential defects in a unit under test is extremely large. A fault-model presumes that most of the defects
More informationAccurate Reliability Analysis of Combinational Circuits using Theorem Proving
Accurate Reliability Analysis of Combinational Circuits using Theorem Proving Osman Hasan, Jigar Patel and Sofiène Tahar Department of Electrical and Computer Engineering, Concordia University, Montreal,
More informationEEC 216 Lecture #2: Metrics and Logic Level Power Estimation. Rajeevan Amirtharajah University of California, Davis
EEC 216 Lecture #2: Metrics and Logic Level Power Estimation Rajeevan Amirtharajah University of California, Davis Announcements PS1 available online tonight R. Amirtharajah, EEC216 Winter 2008 2 Outline
More informationTechnology Mapping for Reliability Enhancement in Logic Synthesis
Technology Mapping for Reliability Enhancement in Logic Synthesis Zhaojun Wo and Israel Koren Department of Electrical and Computer Engineering University of Massachusetts,Amherst,MA 01003 E-mail: {zwo,koren}@ecs.umass.edu
More informationDigital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1
Lecture 5 - Chapter 2 Outline Other Logic Gates and their uses Other Logic Operations CS 2420 Husain Gholoom - lecturer Page 1 Digital logic gates CS 2420 Husain Gholoom - lecturer Page 2 Buffer A buffer
More informationReliability-centric probabilistic analysis of VLSI circuits
University of South Florida Scholar Commons Graduate Theses and Dissertations Graduate School 2006 Reliability-centric probabilistic analysis of VLSI circuits Thara Rejimon University of South Florida
More informationStochastic Computational Models for Accurate Reliability Evaluation of Logic Circuits
Stochastic Computational Models for Accurate Evaluation of Logic Circuits Hao Chen and Jie Han Department of Electrical and Computer Engineering, University of Alberta Edmonton, Alberta, Canada T6G 2V4
More informationDesign and Implementation of Carry Tree Adders using Low Power FPGAs
1 Design and Implementation of Carry Tree Adders using Low Power FPGAs Sivannarayana G 1, Raveendra babu Maddasani 2 and Padmasri Ch 3. Department of Electronics & Communication Engineering 1,2&3, Al-Ameer
More informationConsidering Security Aspects in Safety Environment. Dipl.-Ing. Evzudin Ugljesa
Considering Security spects in Safety Environment Dipl.-ng. Evzudin Ugljesa Overview ntroduction Definitions of safety relevant parameters Description of the oo4-architecture Calculation of the FD-Value
More informationMarkov Reliability and Availability Analysis. Markov Processes
Markov Reliability and Availability Analysis Firma convenzione Politecnico Part II: Continuous di Milano e Time Veneranda Discrete Fabbrica State del Duomo di Milano Markov Processes Aula Magna Rettorato
More informationFault-Tolerant Computing
Fault-Tolerant Computing Motivation, Background, and Tools Slide 1 About This Presentation This presentation has been prepared for the graduate course ECE 257A (Fault-Tolerant Computing) by Behrooz Parhami,
More informationECE 407 Computer Aided Design for Electronic Systems. Simulation. Instructor: Maria K. Michael. Overview
407 Computer Aided Design for Electronic Systems Simulation Instructor: Maria K. Michael Overview What is simulation? Design verification Modeling Levels Modeling circuits for simulation True-value simulation
More informationEvaluation and Validation
Evaluation and Validation Peter Marwedel TU Dortmund, Informatik 12 Germany Graphics: Alexandra Nolte, Gesine Marwedel, 2003 2011 06 18 These slides use Microsoft clip arts. Microsoft copyright restrictions
More informationEvaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking
Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking Gethin Norman, David Parker, Marta Kwiatkowska School of Computer Science, University of
More informationProbabilistic Transfer Matrices in Symbolic Reliability Analysis of Logic Circuits
Probabilistic Transfer Matrices in Symbolic Reliability Analysis of Logic Circuits SMITA KRISHNASWAMY, GEORGE F. VIAMONTES, IGOR L. MARKOV, and JOHN P. HAYES University of Michigan, Ann Arbor We propose
More informationI. INTRODUCTION. CMOS Technology: An Introduction to QCA Technology As an. T. Srinivasa Padmaja, C. M. Sri Priya
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2018 IJSRCSEIT Volume 3 Issue 5 ISSN : 2456-3307 Design and Implementation of Carry Look Ahead Adder
More informationEngineering Risk Benefit Analysis
Engineering Risk Benefit Analysis 1.155, 2.943, 3.577, 6.938, 10.816, 13.621, 16.862, 22.82, ESD.72, ESD.721 RPRA 3. Probability Distributions in RPRA George E. Apostolakis Massachusetts Institute of Technology
More informationAvailability. M(t) = 1 - e -mt
Availability Availability - A(t) the probability that the system is operating correctly and is available to perform its functions at the instant of time t More general concept than reliability: failure
More informationErrata of K Introduction to VLSI Systems: A Logic, Circuit, and System Perspective
Errata of K13126 Introduction to VLSI Systems: A Logic, Circuit, and System Perspective Chapter 1. Page 8, Table 1-1) The 0.35-µm process parameters are from MOSIS, both 0.25-µm and 0.18-µm process parameters
More informationDesign of Optimized Quantum-dot Cellular Automata RS Flip Flops
Int. J. Nanosci. Nanotechnol., Vol. 13, No. 1, March. 2017, pp. 53-58 Design of Optimized Quantum-dot Cellular Automata RS Flip Flops A. Rezaei* 1 Electrical Engineering Department, Kermanshah University
More informationMTJ-Based Nonvolatile Logic-in-Memory Architecture and Its Application
2011 11th Non-Volatile Memory Technology Symposium @ Shanghai, China, Nov. 9, 20112 MTJ-Based Nonvolatile Logic-in-Memory Architecture and Its Application Takahiro Hanyu 1,3, S. Matsunaga 1, D. Suzuki
More informationPARITY BASED FAULT DETECTION TECHNIQUES FOR S-BOX/ INV S-BOX ADVANCED ENCRYPTION SYSTEM
PARITY BASED FAULT DETECTION TECHNIQUES FOR S-BOX/ INV S-BOX ADVANCED ENCRYPTION SYSTEM Nabihah Ahmad Department of Electronic Engineering, Faculty of Electrical and Electronic Engineering, Universiti
More information3/10/2013. Lecture #1. How small is Nano? (A movie) What is Nanotechnology? What is Nanoelectronics? What are Emerging Devices?
EECS 498/598: Nanocircuits and Nanoarchitectures Lecture 1: Introduction to Nanotelectronic Devices (Sept. 5) Lectures 2: ITRS Nanoelectronics Road Map (Sept 7) Lecture 3: Nanodevices; Guest Lecture by
More informationDictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults
Dictionary-Less Defect Diagnosis as Surrogate Single Stuck-At Faults Chidambaram Alagappan and Vishwani D. Agrawal Department of Electrical and Computer Engineering Auburn University, Auburn, AL 36849,
More informationDependable Computer Systems
Dependable Computer Systems Part 3: Fault-Tolerance and Modelling Contents Reliability: Basic Mathematical Model Example Failure Rate Functions Probabilistic Structural-Based Modeling: Part 1 Maintenance
More informationCMPEN 411 VLSI Digital Circuits Spring Lecture 14: Designing for Low Power
CMPEN 411 VLSI Digital Circuits Spring 2012 Lecture 14: Designing for Low Power [Adapted from Rabaey s Digital Integrated Circuits, Second Edition, 2003 J. Rabaey, A. Chandrakasan, B. Nikolic] Sp12 CMPEN
More informationOn the Reliable Performance of Sequential Adders for Soft Computing
On the Reliable Performance of Sequential Adders for Soft Computing Jinghang Liang ECE Department University of Alberta Edmonton, Canada jinghang@ualberta.ca Jie Han ECE Department University of Alberta
More informationEECS150 - Digital Design Lecture 26 - Faults and Error Correction. Types of Faults in Digital Designs
EECS150 - Digital Design Lecture 26 - Faults and Error Correction April 25, 2013 John Wawrzynek 1 Types of Faults in Digital Designs Design Bugs (function, timing, power draw) detected and corrected at
More informationDVClub Europe Formal fault analysis for ISO fault metrics on real world designs. Jörg Große Product Manager Functional Safety November 2016
DVClub Europe Formal fault analysis for ISO 26262 fault metrics on real world designs Jörg Große Product Manager Functional Safety November 2016 Page 1 11/27/2016 Introduction Functional Safety The objective
More informationNovel Modulo 2 n +1Multipliers
Novel Modulo Multipliers H. T. Vergos Computer Engineering and Informatics Dept., University of Patras, 26500 Patras, Greece. vergos@ceid.upatras.gr C. Efstathiou Informatics Dept.,TEI of Athens, 12210
More informationModeling and Optimization for Soft-Error Reliability of Sequential Circuits
4065 1 Modeling and Optimization for Soft-Error Reliability of Sequential Circuits Natasa Miskov-Zivanov, Student Member, IEEE, Diana Marculescu, Member, IEEE Abstract Due to reduction in device feature
More informationFigure 1.1: Schematic symbols of an N-transistor and P-transistor
Chapter 1 The digital abstraction The term a digital circuit refers to a device that works in a binary world. In the binary world, the only values are zeros and ones. Hence, the inputs of a digital circuit
More informationCs302 Quiz for MID TERM Exam Solved
Question # 1 of 10 ( Start time: 01:30:33 PM ) Total Marks: 1 Caveman used a number system that has distinct shapes: 4 5 6 7 Question # 2 of 10 ( Start time: 01:31:25 PM ) Total Marks: 1 TTL based devices
More informationToward Hardware- Redundant, Fault-Tolerant Logic for Nanoelectronics
Advanced Technologies and Reliable Design for Nanotechnology Systems Toward Hardware- Redundant, Fault-Tolerant Logic for Nanoelectronics Jie Han and Jianbo Gao University of Florida Yan Qi Johns Hopkins
More informationEECS150 - Digital Design Lecture 26 Faults and Error Correction. Recap
EECS150 - Digital Design Lecture 26 Faults and Error Correction Nov. 26, 2013 Prof. Ronald Fearing Electrical Engineering and Computer Sciences University of California, Berkeley (slides courtesy of Prof.
More informationComparing the Effects of Intermittent and Transient Hardware Faults on Programs
Comparing the Effects of Intermittent and Transient Hardware Faults on Programs Jiesheng Wei, Layali Rashid, Karthik Pattabiraman and Sathish Gopalakrishnan Department of Electrical and Computer Engineering,
More informationSingle Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference
Single Stuck-At Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of Boolean Difference Copyright 1998 Elizabeth M. Rudnick 1 Modeling the effects
More informationSoft Error Rate Analysis in Combinational Logic
Soft Error Rate Analysis in Combinational Logic Martí Anglada Sánchez Facultat d Informàtica de Barcelona (FIB) Universitat Politècnica de Catalunya (UPC) - BarcelonaTech Advisor: Antonio González, Departament
More informationRALF: Reliability Analysis for Logic Faults An Exact Algorithm and Its Applications
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 Department, University
More informationFault Modeling. Fault Modeling Outline
Fault Modeling Outline Single Stuck-t Fault Model Other Fault Models Redundancy and Untestable Faults Fault Equivalence and Fault Dominance Method of oolean Difference Copyright 1998 Elizabeth M. Rudnick
More informationLecture 12 Digital Circuits (II) MOS INVERTER CIRCUITS
Lecture 12 Digital Circuits (II) MOS INVERTER CIRCUITS Outline NMOS inverter with resistor pull-up The inverter NMOS inverter with current-source pull-up Complementary MOS (CMOS) inverter Static analysis
More informationExclusive OR/ Exclusive NOR
University of Wisconsin - Madison ECE/Comp Sci 352 Digital Systems Fundamentals Charles R. Kime Section 2 Fall 2001 Chapter 2 Combinational Logic Circuits Part 8 Charles Kime & Thomas Kaminski Exclusive
More informationEE 330 Lecture 36. Digital Circuits. Transfer Characteristics of the Inverter Pair One device sizing strategy Multiple-input gates
EE 330 Lecture 36 Digital Circuits Transfer Characteristics of the Inverter Pair One device sizing strategy Multiple-input gates Review from Last Time The basic logic gates It suffices to characterize
More informationDigital Techniques. Figure 1: Block diagram of digital computer. Processor or Arithmetic logic unit ALU. Control Unit. Storage or memory unit
Digital Techniques 1. Binary System The digital computer is the best example of a digital system. A main characteristic of digital system is its ability to manipulate discrete elements of information.
More informationEE241 - Spring 2000 Advanced Digital Integrated Circuits. Announcements
EE241 - Spring 2 Advanced Digital Integrated Circuits Lecture 11 Low Power-Low Energy Circuit Design Announcements Homework #2 due Friday, 3/3 by 5pm Midterm project reports due in two weeks - 3/7 by 5pm
More informationParallel VLSI CAD Algorithms. Lecture 1 Introduction Zhuo Feng
Parallel VLSI CAD Algorithms Lecture 1 Introduction Zhuo Feng 1.1 Prof. Zhuo Feng Office: EERC 513 Phone: 487-3116 Email: zhuofeng@mtu.edu Class Website http://www.ece.mtu.edu/~zhuofeng/ee5900spring2012.html
More informationBoolean Algebra, Gates and Circuits
Boolean Algebra, Gates and Circuits Kasper Brink November 21, 2017 (Images taken from Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc.) Outline Last week: Von
More informationDesign and Implementation of Reversible Binary Comparator N.SATHISH 1, T.GANDA PRASAD 2
www.semargroup.org, www.ijsetr.com ISSN 2319-8885 Vol.03,Issue.03, March-2014, Pages:0356-0363 Design and Implementation of Reversible Binary Comparator N.SATHISH 1, T.GANDA PRASAD 2 1 PG Scholar, Dept
More informationPERFORMANCE METRICS. Mahdi Nazm Bojnordi. CS/ECE 6810: Computer Architecture. Assistant Professor School of Computing University of Utah
PERFORMANCE METRICS Mahdi Nazm Bojnordi Assistant Professor School of Computing University of Utah CS/ECE 6810: Computer Architecture Overview Announcement Jan. 17 th : Homework 1 release (due on Jan.
More informationDigital Integrated Circuits A Design Perspective
igital Integrated Circuits esign Perspective esigning Combinational Logic Circuits 1 Combinational vs. Sequential Logic In Combinational Logic Circuit Out In Combinational Logic Circuit Out State Combinational
More informationA DESIGN DIVERSITY METRIC AND RELIABILITY ANALYSIS FOR REDUNDANT SYSTEMS. Subhasish Mitra, Nirmal R. Saxena and Edward J.
A DESIGN DIVERSITY METRIC AND RELIABILITY ANALYSIS FOR REDUNDANT SYSTEMS Subhasish Mitra Nirmal R. Saxena and Edward J. McCluskey Center for Reliable Computing (http://crc.stanford.edu) Departments of
More informationEE115C Digital Electronic Circuits Homework #5
EE115C Digital Electronic Circuits Homework #5 Due Thursday, May 13, 6pm @ 56-147E EIV Problem 1 Elmore Delay Analysis Calculate the Elmore delay from node A to node B using the values for the resistors
More informationComputer Science & Engineering Dept, West Bengal University of Technology 2 Information Technology Dept, Manipal University
Quantum Realization Full Adder-Subtractor Circuit Design Using Islam gate Madhumita Mazumder 1, Indranil Guha Roy 2 1, Computer Science & Engineering Dept, West Bengal University of Technology 2 Information
More informationReduced-Error Constant Correction Truncated Multiplier
This article has been accepted and published on J-STAGE in advance of copyediting. Content is final as presented. IEICE Electronics Express, Vol.*, No.*, 1 8 Reduced-Error Constant Correction Truncated
More informationImplementation of Reversible Control and Full Adder Unit Using HNG Reversible Logic Gate
Implementation of Reversible Control and Full Adder Unit Using HNG Reversible Logic Gate Naresh Chandra Agrawal 1, Anil Kumar 2, A. K. Jaiswal 3 1 Research scholar, 2 Assistant Professor, 3 Professor,
More informationIntro To Digital Logic
Intro To Digital Logic 1 Announcements... Project 2.2 out But delayed till after the midterm Midterm in a week Covers up to last lecture + next week's homework & lab Nick goes "H-Bomb of Justice" About
More informationLEADING THE EVOLUTION OF COMPUTE MARK KACHMAREK HPC STRATEGIC PLANNING MANAGER APRIL 17, 2018
LEADING THE EVOLUTION OF COMPUTE MARK KACHMAREK HPC STRATEGIC PLANNING MANAGER APRIL 17, 2018 INTEL S RESEARCH EFFORTS COMPONENTS RESEARCH INTEL LABS ENABLING MOORE S LAW DEVELOPING NOVEL INTEGRATION ENABLING
More informationECE321 Electronics I
ECE321 Electronics I Lecture 1: Introduction to Digital Electronics Payman Zarkesh-Ha Office: ECE Bldg. 230B Office hours: Tuesday 2:00-3:00PM or by appointment E-mail: payman@ece.unm.edu Slide: 1 Textbook
More informationSpeeding up Reliability Analysis for Large-scale Circuits
University of Windsor Scholarship at UWindsor Electronic Theses and Dissertations 2016 Speeding up Reliability Analysis for Large-scale Circuits Jinchen Cai University of Windsor Follow this and additional
More informationIntegrating Reliability into the Design of Power Electronics Systems
Integrating Reliability into the Design of Power Electronics Systems Alejandro D. Domínguez-García Grainger Center for Electric Machinery and Electromechanics Department of Electrical and Computer Engineering
More informationCase Studies of Logical Computation on Stochastic Bit Streams
Case Studies of Logical Computation on Stochastic Bit Streams Peng Li 1, Weikang Qian 2, David J. Lilja 1, Kia Bazargan 1, and Marc D. Riedel 1 1 Electrical and Computer Engineering, University of Minnesota,
More informationQuantum computing with superconducting qubits Towards useful applications
Quantum computing with superconducting qubits Towards useful applications Stefan Filipp IBM Research Zurich Switzerland Forum Teratec 2018 June 20, 2018 Palaiseau, France Why Quantum Computing? Why now?
More informationNAND, NOR and XOR functions properties
Laboratory NAND, NOR and XOR functions properties. Laboratory work goals Enumeration of NAND, NOR and XOR functions properties Presentation of NAND, NOR and XOR modules Realisation of circuits with gates
More informationEvaluation and Validation
Evaluation and Validation Jian-Jia Chen (slides are based on Peter Marwedel) TU Dortmund, Informatik 12 Germany Springer, 2010 2018 年 01 月 17 日 These slides use Microsoft clip arts. Microsoft copyright
More informationTOSHIBA CMOS Digital Integrated Circuit Silicon Monolithic TC7SG02FU IN A GND
TOSHIBA CMOS Digital Integrated Circuit Silicon Monolithic TC7SG02FU 2 Input NOR Gate Features High-level output current: I OH /I OL = ±8 ma (min) at = 3.0 High-speed operation: t pd = 2.4 ns (typ.) at
More informationDepartment of Electrical and Computer Engineering University of Wisconsin Madison. Fall Midterm Examination CLOSED BOOK
Department of Electrical and Computer Engineering University of Wisconsin Madison ECE 553: Testing and Testable Design of Digital Systems Fall 2014-2015 Midterm Examination CLOSED BOOK Kewal K. Saluja
More informationMark Redekopp, All rights reserved. Lecture 1 Slides. Intro Number Systems Logic Functions
Lecture Slides Intro Number Systems Logic Functions EE 0 in Context EE 0 EE 20L Logic Design Fundamentals Logic Design, CAD Tools, Lab tools, Project EE 357 EE 457 Computer Architecture Using the logic
More information194 IEEE TRANSACTIONS ON NANOTECHNOLOGY, VOL. 4, NO. 2, MARCH Yan Qi, Jianbo Gao, and José A. B. Fortes, Fellow, IEEE
194 IEEE TRANSACTIONS ON NANOTECHNOLOGY, VOL. 4, NO. 2, MARCH 2005 Markov Chains and Probabilistic Computation A General Framework for Multiplexed Nanoelectronic Systems Yan Qi, Jianbo Gao, and José A.
More informationTracking Uncertainty with Probabilistic Logic Circuit Testing
Computer-Aided Design for Emerging Technologies Tracking Uncertainty with Probabilistic Logic Circuit Testing Smita Krishnaswamy, Igor L. Markov, and John P. Hayes University of Michigan Editor s note:
More informationNew polynomials for strong algebraic manipulation detection codes 1
Fifteenth International Workshop on Algebraic and Combinatorial Coding Theory June 18-24, 2016, Albena, Bulgaria pp. 7 12 New polynomials for strong algebraic manipulation detection codes 1 Maksim Alekseev
More informationFormal Fault Analysis of Branch Predictors: Attacking countermeasures of Asymmetric key ciphers
Formal Fault Analysis of Branch Predictors: Attacking countermeasures of Asymmetric key ciphers Sarani Bhattacharya and Debdeep Mukhopadhyay Indian Institute of Technology Kharagpur PROOFS 2016 August
More informationLiterature Review on Multiplier Accumulation Unit by Using Hybrid Adder
Literature Review on Multiplier Accumulation Unit by Using Hybrid Adder Amiya Prakash M.E. Scholar, Department of (ECE) NITTTR Chandigarh, Punjab Dr. Kanika Sharma Assistant Prof. Department of (ECE) NITTTR
More informationCMP 338: Third Class
CMP 338: Third Class HW 2 solution Conversion between bases The TINY processor Abstraction and separation of concerns Circuit design big picture Moore s law and chip fabrication cost Performance What does
More informationBoolean Logic Prof. James L. Frankel Harvard University. Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved.
Boolean Logic Prof. James L. Frankel Harvard University Version of 3:20 PM 29-Aug-2017 Copyright 2017, 2016 James L. Frankel. All rights reserved. Logic Levels Logic 0 Also called GND Low Off False Logic
More informationSection 3: Combinational Logic Design. Department of Electrical Engineering, University of Waterloo. Combinational Logic
Section 3: Combinational Logic Design Major Topics Design Procedure Multilevel circuits Design with XOR gates Adders and Subtractors Binary parallel adder Decoders Encoders Multiplexers Programmed Logic
More informationECE 342 Electronic Circuits. Lecture 34 CMOS Logic
ECE 34 Electronic Circuits Lecture 34 CMOS Logic Jose E. Schutt-Aine Electrical & Computer Engineering University of Illinois jesa@illinois.edu 1 De Morgan s Law Digital Logic - Generalization ABC... ABC...
More information