1 System-Level Vulnerability Estimation for Data Caches.

Slides:



Advertisements
Similar presentations
Runahead Execution: An Alternative to Very Large Instruction Windows for Out-of-order Processors Onur Mutlu, The University of Texas at Austin Jared Start,
Advertisements

Lecture 12 Reduce Miss Penalty and Hit Time
Cache Performance 1 Computer Organization II © CS:APP & McQuain Cache Memory and Performance Many of the following slides are taken with.
FLEXclusion: Balancing Cache Capacity and On-chip Bandwidth via Flexible Exclusion Jaewoong Sim Jaekyu Lee Moinuddin K. Qureshi Hyesoon Kim.
Performance of Cache Memory
Practical Caches COMP25212 cache 3. Learning Objectives To understand: –Additional Control Bits in Cache Lines –Cache Line Size Tradeoffs –Separate I&D.
UPC Microarchitectural Techniques to Exploit Repetitive Computations and Values Carlos Molina Clemente LECTURA DE TESIS, (Barcelona,14 de Diciembre de.
Microprocessor Reliability
1 Saad Arrabi 2/24/2010 CS  Definition of soft errors  Motivation of the paper  Goals of this paper  ACE and un-ACE bits  Results  Conclusion.
Sim-alpha: A Validated, Execution-Driven Alpha Simulator Rajagopalan Desikan, Doug Burger, Stephen Keckler, Todd Austin.
IVF: Characterizing the Vulnerability of Microprocessor Structures to Intermittent Faults Songjun Pan 1,2, Yu Hu 1, and Xiaowei Li 1 1 Key Laboratory of.
Using Hardware Vulnerability Factors to Enhance AVF Analysis Vilas Sridharan RAS Architecture and Strategy AMD, Inc. International Symposium on Computer.
Improving Cache Performance by Exploiting Read-Write Disparity
Mitigating the Performance Degradation due to Faults in Non-Architectural Structures Constantinos Kourouyiannis Veerle Desmet Nikolas Ladas Yiannakis Sazeides.
Variability in Architectural Simulations of Multi-threaded Workloads Alaa R. Alameldeen and David A. Wood University of Wisconsin-Madison
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon, Oct 31, 2005 Topic: Memory Hierarchy Design (HP3 Ch. 5) (Caches, Main Memory and.
1 COMP 206: Computer Architecture and Implementation Montek Singh Mon., Nov. 3, 2003 Topic: Memory Hierarchy Design (HP3 Ch. 5) (Caches, Main Memory and.
331 Lec20.1Fall :332:331 Computer Architecture and Assembly Language Fall 2003 Week 13 Basics of Cache [Adapted from Dave Patterson’s UCB CS152.
Data Partitioning Techniques for Partially Protected Caches to Reduce Soft Error Induced Failures (DIPES 08) Kyoungwoo Lee.
ENEE350 Ankur Srivastava University of Maryland, College Park Based on Slides from Mary Jane Irwin ( )
331 Lec20.1Spring :332:331 Computer Architecture and Assembly Language Spring 2005 Week 13 Basics of Cache [Adapted from Dave Patterson’s UCB CS152.
CML CML Cache Vulnerability Equations for Protecting Data in Embedded Processor Caches from Soft Errors † Aviral Shrivastava, € Jongeun Lee, † Reiley Jeyapaul.
Barcelona, Spain November 13, 2005 WAR-1: Assessing SEU Vulnerability Via Circuit-Level Timing Analysis 1 Assessing SEU Vulnerability via Circuit-Level.
Justin Meza Qiang Wu Sanjeev Kumar Onur Mutlu Revisiting Memory Errors in Large-Scale Production Data Centers Analysis and Modeling of New Trends from.
Prof. Hakim Weatherspoon CS 3410, Spring 2015 Computer Science Cornell University See P&H Chapter: , 5.8, 5.10, 5.15; Also, 5.13 & 5.17.
Roza Ghamari Bogazici University.  Current trends in transistor size, voltage, and clock frequency, future microprocessors will become increasingly susceptible.
IVEC: Off-Chip Memory Integrity Protection for Both Security and Reliability Ruirui Huang, G. Edward Suh Cornell University.
Copyright © 2008 UCI ACES Laboratory Kyoungwoo Lee 1, Aviral Shrivastava 2, Nikil Dutt 1, and Nalini Venkatasubramanian 1.
SiLab presentation on Reliable Computing Combinational Logic Soft Error Analysis and Protection Ali Ahmadi May 2008.
The Memory Hierarchy 21/05/2009Lecture 32_CA&O_Engr Umbreen Sabir.
Cache Control and Cache Coherence Protocols How to Manage State of Cache How to Keep Processors Reading the Correct Information.
Performance Prediction for Random Write Reductions: A Case Study in Modelling Shared Memory Programs Ruoming Jin Gagan Agrawal Department of Computer and.
1 Tuning Garbage Collection in an Embedded Java Environment G. Chen, R. Shetty, M. Kandemir, N. Vijaykrishnan, M. J. Irwin Microsystems Design Lab The.
CSIE30300 Computer Architecture Unit 08: Cache Hsin-Chou Chi [Adapted from material by and
ImanFaraji Time-based Snoop Filtering in Chip Multiprocessors Amirkabir University of Technology Tehran, Iran University of Victoria Victoria, Canada Amirali.
Improving Cache Performance by Exploiting Read-Write Disparity Samira Khan, Alaa R. Alameldeen, Chris Wilkerson, Onur Mutlu, and Daniel A. Jiménez.
Using LINPACK + STREAM to Build a Simple, Composite Metric for System Throughput John D. McCalpin, Ph.D. IBM Corporation Austin, TX Presented ,
Multiprocessor cache coherence. Caching: terms and definitions cache line, line size, cache size degree of associativity –direct-mapped, set and fully.
Relyzer: Exploiting Application-level Fault Equivalence to Analyze Application Resiliency to Transient Faults Siva Hari 1, Sarita Adve 1, Helia Naeimi.
Analytical Approach for Soft Error Rate Estimation of SRAM-Based FPGAs Ghazanfar (Hossein) Asadi and Mehdi B. Tahoori Why Soft Error Rate (SER) Estimation?
Caches Where is a block placed in a cache? –Three possible answers  three different types AnywhereFully associativeOnly into one block Direct mappedInto.
EEL-4713 Ann Gordon-Ross 1 EEL-4713 Computer Architecture Memory hierarchies.
CML Smart Cache Cleaning: Energy Efficient Vulnerability Reduction in Embedded Processors Reiley Jeyapaul, and Aviral Shrivastava Compiler Microarchitecture.
Pipelining and Parallelism Mark Staveley
Outline Cache writes DRAM configurations Performance Associative caches Multi-level caches.
11 Online Computing and Predicting Architectural Vulnerability Factor of Microprocessor Structures Songjun Pan Yu Hu Xiaowei Li {pansongjun, huyu,
Performance Implications of Faults in Prediction Arrays Nikolas Ladas Yiannakis Sazeides Veerle Desmet University of Cyprus Ghent University DFR’ 10 Pisa,
1 1 Slide Simulation Professor Ahmadi. 2 2 Slide Simulation Chapter Outline n Computer Simulation n Simulation Modeling n Random Variables and Pseudo-Random.
1  2004 Morgan Kaufmann Publishers Chapter Seven Memory Hierarchy-3 by Patterson.
Architectural Vulnerability Factor (AVF) Computation for Address-Based Structures Arijit Biswas, Paul Racunas, Shubu Mukherjee FACT Group, DEG, Intel Joel.
1 Efficient System-on-Chip Energy Management with a Segmented Counting Bloom Filter Mrinmoy Ghosh- Georgia Tech Emre Özer- ARM Ltd Stuart Biles- ARM Ltd.
Harnessing Soft Computation for Low-Budget Fault Tolerance Daya S Khudia Scott Mahlke Advanced Computer Architecture Laboratory University of Michigan,
Methodology to Compute Architectural Vulnerability Factors Chris Weaver 1, 2 Shubhendu S. Mukherjee 1 Joel Emer 1 Steven K. Reinhardt 1, 2 Todd Austin.
Dynamic Branch Prediction During Context Switches Jonathan Creekmore Nicolas Spiegelberg T NT.
JouleTrack - A Web Based Tool for Software Energy Profiling Amit Sinha and Anantha Chandrakasan Massachusetts Institute of Technology June 19, 2001.
Computer Organization CS224 Fall 2012 Lessons 39 & 40.
Memory Hierarchy— Five Ways to Reduce Miss Penalty.
Memory Hierarchy and Cache Design (3). Reducing Cache Miss Penalty 1. Giving priority to read misses over writes 2. Sub-block placement for reduced miss.
GangES: Gang Error Simulation for Hardware Resiliency Evaluation Siva Hari 1, Radha Venkatagiri 2, Sarita Adve 2, Helia Naeimi 3 1 NVIDIA Research, 2 University.
Chapter 9 Memory Organization. 9.1 Hierarchical Memory Systems Figure 9.1.
Improving Multi-Core Performance Using Mixed-Cell Cache Architecture
Cache Memory and Performance
Memory COMPUTER ARCHITECTURE
ECE 445 – Computer Organization
Analytical Approach for Soft Error Rate Estimation of SRAM-Based FPGAs
CARP: Compression-Aware Replacement Policies
Morgan Kaufmann Publishers Memory Hierarchy: Cache Basics
Lois Orosa, Rodolfo Azevedo and Onur Mutlu
A Novel Cache-Utilization Based Dynamic Voltage Frequency Scaling (DVFS) Mechanism for Reliability Enhancements *Yen-Hao Chen, *Yi-Lun Tang, **Yi-Yu Liu,
Presentation transcript:

1 System-Level Vulnerability Estimation for Data Caches

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Goal: Improving accuracy of previously suggested vulnerability factor Motivation: Read frequency and components error masking (previously ignored, significantly affect the accuracy ) Our Solution: SVF : System-level vulnerability factor Key Result Vulnerability estimation accuracy in cache (  40%) 1010 & 0011 = 0010 This Work: Accurate Vulnerability Modeling for Cache Memory & 0011 =

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Why Reliability Analysis for Cache ? Error rate is expected to increase in cache o 92% of system reboots are initiated by soft-error occurring in cache [Shazli08] o Soft-error sources: α particles and neutrons strike Reliability aware design is necessary o Having cost-effective design Accurate vulnerability analysis Need early design phase vulnerability estimation 3

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Failure in Time (Our focus) 4

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Life Time Analysis Typical cache block access Vul Blk = (t 2 -t 1 ) AVF Blk = (t 2 -t 1 )/t 3 AVF cache =  AVF blk_i /number_blks Vulnerable FillReadEvict Time t1t1 t2t2 t3t3 5 Blk

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Life Time Analysis Advantages: o Early design vulnerability estimation o Less detailed model and single pass simulation Disadvantages: o Overestimates AVF Up to 260% discrepancy with Fault injection [Wang07] o Overlooking read frequency & error masking 6

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Read Frequency Vul Blk1 = t 4 - t 1 Vul Blk1 = (t 2 -t 1 ) + (t 3 -t 2 ) + (t 4 -t 3 )= t 4 - t 1 AVF Blk1 = AVF Blk2 = (t 4 -t 1 )/t 5 7 Vul. Fill Read 1 Evict t1t1 t2t2 t3t3 Time t4t4 t5t5 Blk 1 Vul. Fill Read 1 Evict t1t1 t2t2 t3t3 Time Vul. Read 2 Read 3 Blk 2 t4t4 t5t5

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Error Masking Lifetime analysis: Vul Blk = (t 2 -t 1 ) Accurate analysis: Vul Blk = 0 P( Masking )=1 Blk i 8

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Our Solution: SVF SVF considers read frequency & error masking SVF: Percentage of errors that occur in a component and propagate to system outputs SVF uses the following: o P(masking) = IOM o P(propagation) = 1 – IOM 9

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide SVF Analysis Fill Read 1 Read 2 Time t0t0 t1t1 t2t2 t3t3 Evict 10 Byte i th

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Detailed SV Analysis Erroneous data in cache result failure: o Written-back to main memory o Read by CPU SV different cases : o Case 1 : Clean byte o Case 2 : Dirty byte without write o Case 3 : Dirty byte with write 11

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide SV Scenario on Clean Byte Case 1 : Clean byte 12 Fill Read 1 Read 2 Time t0t0 t1t1 t2t2 tntn Evict Byte i th... Read n t ev

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide SV Different Scenarios Case 2 : Dirty byte without write 13 Fill Read 1 Read 2 t0t0 t1t1 t2t2 tntn Write-Back Byte i th... Read n t write-back

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide SV different scenarios Case 3: Dirty block with write 14 Fill Read 1 Read 2 t0t0 tr 1 tr 2 tw k Write-Back Byte i th... write k t write-back write 1 tw 1

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Methodology sim-alpha simulator o F.I running in functional simulation mode o SVF calculation running in detailed simulation mode SPEC2000 benchmarks Processor configuration 15 FUs : 4 iALUs, 4 iMultiplier/divider, 1 fpALUs, 1 fpMultiplier/divider LSQ / RUU / ROB size : 32 / 32 / 32 Instructions DL1/IL1 : 4-way, 64KB, 3 cycle / 2-way, 64KB, 1 cycle 64 B cache line cycle Memory access

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide IOM cpu Estimation Fault injection on load instructions o F.I= Fault injection point Observe propagation on store instructions o O.P= Observation point IOM = #Correct /# Total F.IO.P 16

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide IOM cpu Sensitivity: Number of Runs 17 IOM

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Vulnerability Factors for Write-back Data Cache 18 VF

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Vulnerability Factors for Write-Through Data Cache 19 VF

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide SVF cache Accuracy Improvement vs AVF 20 Accuracy

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Summary System-level vulnerability modeling technique o Investigates read frequency & erorr masking Our result o Large AVF-SVF discrepancy in storage components with long storing times. WT cache – 40% improved accuracy 21

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Questions 22

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Backup Slide 1 F.I Simulation Time for IOM cpu experiments 23

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Backup Slide 2 Relax IOM probability for each read access to IOM for total reads Reference model is AVF Validation model based on Fault injection is under development TVF cache is 50% TVF = Timing Vulnerability Factor o TVF latch = %50 o TVF SRAM =%100 24

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Backup slide 3 Fill Read 1 Read 2 Read 3 Time t0t0 t1t1 t2t2 t3t3 t4t4 Evict 25

PRDC 2010, Dec. 15 System-Level Vulnerability Estimation for Data Caches Slide Backup Slide 4 IOM IU 26