1. Using Memory to Cope with Simultaneous Transient Faults Authors: Universidade Federal do Rio Grande do Sul Programa de Pós-Graduação em Engenharia Elétrica Eduardo L. Rhod(eduardo.rhod@ufrgs.br) Carlos A. L. Lisbôa(calisboa@inf.ufrgs.br) Luigi Carro(carro@inf.ufrgs.br)

2. 2 The Problem Due to the technology scaling, future (an actual) technologies will be heavily influenced by electromagnetic noise causing SEU and SET inducted errors; The ocurence of multiple SEU and SET, which was not a problem in the past, must have to be considered; We must guarantee robustness at lowest cost; Some usual protection techniques like TMR and N-MR might not work properly;

3. 3 Motivations Memory comes with intrinsic protection against manufacturing errors (spare columns and spare rows); There are protection techniques with low area and latency overhead like Reed Solomon that can be applied;

4. 4 Our Proposal Use Reed-Solomon protected memory to replace combinational circuit; Reducing the area sensible to faults; Reducing the SER (soft error rate) of the circuit;

5. 5 Outline Case Studies; Results; Conclusions; Future Work.

6. 6 Replacing Combinational Circuit by Memory (ROM memory) Example: 4x4 bit multiplier -Fully combinational: Total area = 304 transistors Fully memory: Memory Input A Input B 4 4 result 8 Total area = 2,048 transistors considering 1 transistor per bit 8 inputs and 8 outputs 2 8 x 8 = 2,048 bits EXPENSIVE X

7. 7 Replacing Combinational Circuit by Memory (ROM memory) Example: 4x4 bit multiplier -Fully combinational: Total area = 304 transistors Let’s Replace just some part of the circuit !!! 1 column Area cost = 512 transistors Latency = 7 cycles Memory 512 bits 4 2 7 x 4 = 512 bits 7 inputs and 4 outputs

8. 8 Case Studies 4x4 bit multiplier Two memory based solutions were proposed: Column multiplier; Line multiplier; These two solutions were compared with the TMR and N-MR techniques.

9. 9 Case Studies 4 taps 8 bit FIR Filter Memory based solution compared with the combinational one

10. 10 Case Studies 4x4 bit multiplier -Column Solution Protected by RS code Sensitive to Faults

11. 11 Case Studies 4x4 bit multiplier - Line Solution Sensitive to Faults Protected by RS code

12. 12 Memory With coef. Input 1 Input 2 Input 3 Input 4 Result 10 8 8 8 8 Case Studies 8-bits FIR Filter with 4 taps Just using memory: Memory size 2 4*8 x 18 = 77 Gb Memory + comb sol.: Memory size 2 4 x 10 = 160 bits Latency = 8 cycles Sensitive to faults Protected by RS code

13. 13 Fault Injection Process Fault injection Steps: Run the circuit fault free with the 1st input; Run the circuit with “single event level 0” at the 1st gate; Compare the fault free and the “single event level 0” results to detect if the fault have propagated; Run the circuit with “single event level 1” at the 1st gate; Compare the fault free and the “single event level 1” results to detect if the fault have propagated; Repeat the process for all gates; Repeat the process for all inputs; Repeat the process for double faults;

14. 14 Results CircuitTotal Area # of gates that fail Latency (ns) Fault rate (%) Proportional fault rate (%) 5-MR212853218.58.80 TMR107226218.25.492.77 Combinational3047617.549.027.00 Column20043312046.822.90 Line425296670.231.19 4x4 Bit Multiplier Fault Rate Results for SINGLE Fault Injection 3 x 7 x 2 x more area The voter Is too big

15. 15 Results CircuitTotal Area # of gates that fail Latency (ns) Proportional fault rate (%) 5-MR212853218.520.50 TMR107226218.28.19 Combinational3047617.58.95 Column2004331204.19 Line42529661.53 4x4 Bit Multiplier Fault Rate Results for DOUBLE Fault Injection 5 x 13 x 2 x more area 2 x 5 x The voter Is too big 4 x more area

16. 16 Results CircuitTotal Area# of gates that fail Latency (ns) Proportional fault rate (%) Combinational652416316948.21 Memory18325056.82.58 FIR Filter Fault Rate Results for SINGLE Fault Injection 3.5 x less area 18 x CircuitTotal Area# of gates that fail Latency (ns) Proportional fault rate (%) Combinational652416316967.35 Memory18325056.82.96 FIR Filter Fault Rate Results for DOUBLE Fault Injection 3.5 x less area 22.5 x

17. 17 Conclusions This work showed that replacing combinational circuit by memory based circuit can be used to improve circuit reliability against single and double faults, with some penalties in area and computational time; The presented technique, permits different memory based solutions with different costs and gains; Results showed that 5-MR technique may not work as expected.

18. 18 Future Work Implement this technique using magnetic memory (no area overhead); Test the presented approach with different case studies; Develop a tool that chooses between different memory based solutions, which best fit for each application; Implement this technique to develop a memory based processor.

19. 19 Thank You !!! Questions ??? e-mails: Eduardo L. Rhod(eduardo.rhod@ufrgs.br) Carlos A. L. Lisbôa(calisboa@inf.ufrgs.br) Luigi Carro(carro@inf.ufrgs.br)

20. 20 Fault Injection Process Tools: 4x4 bit multiplier Caco-ps – Cycle Accurate Configurable Power Simulator - combinational; - column; - line; Synthesized solutions* (for more than 100 gates failing): - TMR; - 5-MR; FIR Filter - combinational; - memory based; *using Altera FPGA EP20K200EFC484-2X.