Possible Memory Redundancy Schemes 1450.6.2 (redundancy sub-team)

Slides:



Advertisements
Similar presentations
Group - E Group Members Burdukov, Ilya Igorevich Lewczyk, Tomasz Sithambaram, Sasitharan Penmatcha, Bharath Steszewski, Andrew Joseph MAE412.
Advertisements

KAPIL PANWAR B. Tech 2 nd Year Electrical Engineering.
Enter the data range in the Input range box
Electronics Merit Badge
Ver 1 Nov29, 2001 Slide #1 WebDAV Bindings Property Author: Peter Raymond.
Address-based Route Reflection Ruichuan Chen (MPI-SWS) Aman Shaikh (AT&T Labs - Research) Jia Wang (AT&T Labs - Research) Paul Francis (MPI-SWS) CoNEXT.
Lecture 9 Central Bank Independence and Conservative Central Banking.
BENNY SHEINMAN, DAN RITTER MICROELECTRONIC RESEARCH CENTER
1 Gauss-Jordan Method. How To complete Problem 2.2 # 29 Produced by E. Gretchen Gascon.
CH14 Instruction Level Parallelism and Superscalar Processors
Reducing Order Enforcement Cost in Complex Query Plans Ravindra Guravannavar and S. Sudarshan (To appear in ICDE 2007)
Bus 480 – Lecture 2 Transportation and Assignment models
Computer Science Education
1 Linked List Demo Node third = new Node(); third.item = "Carol"; third.next = null; Node second = new Node(); second.item = "Bob"; second.next = third;
Testing “Multiple Conditions” with Decision Table Technique
 =====T-Nova 1 GSM - UMTS Interworking - Mechanisms Roland Schmitz T-Nova Deutsche Telekom Group TSG-T3 (USIM) meeting #8Tdoc T Bonn 23.
APAN-CN Updates Xing Li .
SugarCRM Database Deployment Variants DB in separate Service Template DB external to Service Template.
NSF ANNUAL REVIEW June 2010 Ocean Observatories Initiative August Release 1 Life Cycle Architecture (LCA) Review Status of CI Project Matthew Arrott.
Bottom-up Parser Table Construction David Walker COS 320.
12 System of Linear Equations Case Study
+ or -?.
Today’s agenda: Potential Changes Around a Circuit. You must be able to calculate potential changes around a closed loop. Emf, Terminal Voltage, and Internal.
Slides created by: Professor Ian G. Harris Efficient C Code  Your C program is not exactly what is executed  Machine code is specific to each ucontroller.
ARM versions ARM architecture has been extended over several versions.
Machine & Assembly Language. Machine Language  Computer languages cannot be read directly by the computer – they are not in binary.  All commands need.
Appendix D The ARM Processor
Copyright  Hannu Laine C++-programming Part 8 Hannu Laine.
RAT R1 R2 R3 R4 R5 R6 R7 Fetch Q RS MOB ROB Execute Retire.
Instruction Level Parallelism
Overheads for Computers as Components 2nd ed.
Gamma DBMS (Part 2): Failure Management Query Processing Shahram Ghandeharizadeh Computer Science Department University of Southern California.
Suranaree University Of Technology มทส  2002 Anant Oonsivilai 2002/2/27 Microcomputers and Microprocessors Chapter Assembly Language Programming.
Computer Architecture CS 215
CPSC 330 Fall 1999 HW #1 Assigned September 1, 1999 Due September 8, 1999 Submit in class Use a word processor (although you may hand-draw answers to Problems.
CPEN Digital System Design
CPU performance CPU power consumption
MIPS Assembly Tutorial
THUMB Instructions: Branching and Data Processing
ITEC 352 Lecture 13 ISA(4).
90th IETF, Toronto, July 2014 IS-IS Route Preference for Extended IP and IPv6 Reachability draft-ginsberg-isis-route-preference-00.txt Les Ginsberg
3-9 Imaginary Numbers Objective: Classify numbers into sets. Combine like terms with radicals. Introduce and learn to use and simplify and solve equations.
Figure (a) 8 * 8 array (b) 16 * 8 array.
Memory Address Decoding
Disk Failures Xiaqing He ID: 204 Dr. Lin. Content 1) RAID stands for: “redundancy array of independent disks” 2) Several schemes to recover from disk.
Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Operating System Machine.
Центр атестації педагогічних працівників 2014
Галактики і квазари.
Data Representation and Alignment Topics Simple static allocation and alignment of basic types and data structures Policies Mechanisms.
Data Representation Recovery from Disk Crashes – 13.4 Presented By: Deepti Bhardwaj Roll No. 223_103 SJSU ID:
Memory interface Memory is a device to store data
1 Chapter 7: Storage Systems Introduction Magnetic disks Buses RAID: Redundant Arrays of Inexpensive Disks.
Memory Layout and SLC500™ System Addresses. Processor Memory Division An SLC 500 processor's memory is divided into two storage areas. Like two drawers.
EE141 VLSI Test Principles and Architectures Ch. 9 - Memory Diagnosis & BISR - P. 1 1 Chapter 9 Memory Diagnosis and Built-In Self-Repair.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /3/2013 Lecture 9: Memory Unit Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER SCIENCE CENTRAL.
CTL – Redundancy sub-team update 09/11/2009 Team: Slimane,Saman,Gary,Karen,Srinivas,Rajat.
Matrix Multiplication The Introduction. Look at the matrix sizes.
CTL - Redundancy. Discussions – February 28, 2007.
1 Contents Memory types & memory hierarchy Virtual memory (VM) Page replacement algorithms in case of VM.
CTL - redundancy Saman, Slimane, Gary, Rajat Last Updated : June 11, 2010.
Advanced Tables. Spanning Columns and Rows: So far, our tables have been relatively simple, with a uniform grid of rows and columns: XHTML allows us to.
© 207 M. Tallman. © 2007 M. Tallman Array- objects or symbols displayed in rows and columns. 3 Rows 4 Columns of 4 of 3.
$200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200 $400 $600 $800 $1000 $200.
Computer architecture and computer organization
Computer Architecture & Operations I
The Operating System Machine Level
CDA4150 Lecture 4 1/17/2019.
Съобщение Ръководството на НУ “Христо Ботев“ – гр. Елин Пелин
Contents Memory types & memory hierarchy Virtual memory (VM)

Presentation transcript:

Possible Memory Redundancy Schemes (redundancy sub-team)

IO Redundancy Single IO to replace any Faulty IO in the memory –Based on shifted IO replacement –Very common –I covered that in my presentation Multiple IO to replace any Faulty IO in the memory –Each IO is mobile within the whole IO range –Difficult to implement in the memory –Should be independent of the memory Segmentation

Column Redundancy Single Column Redundancy that can replace any Column in memory –Implementation is not common C3 C0 C1 C2 RC r0 r4 r3 r2 r1 Q[7] Q[2] Q[1] Q[0] Q[6] C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 ColMux Memory IO Columns Bit0 Bit6 Bit1 Bit2 Bit7

Column Redundancy Multiple Columns mobile across the whole memory array –Very rare to find in present SRAMs C3 C0 C1 C2 RC1 r0 r4 r3 r2 r1 Q[7] Q[2] Q[1] Q[0] Q[6] C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 ColMux Memory IO Columns Bit0 Bit6 Bit1 Bit2 Bit7 RC2 Repair Mechanism

Column Redundancy Multiple Columns (Mostly 2 Columns) Restricted Mobility Within the IO –Replace only Consecutive Column with different Column Address bits C3 C0 C1 C2 RC r0 r4 r3 r2 r1 Q[7] Q[2] Q[1] Q[0] Q[6] C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 ColMux Memory IO Columns Bit0 Bit6 Bit1 Bit2 Bit7 RC

Row Redundancy Single Row mobile across the Whole memory Array C3 C0 C1 C2 r0 r4 r3 r2 r1 Q[7] Q[2] Q[1] Q[0] Q[6] C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 ColMux Memory IO Columns Bit0 Bit6 Bit1 Bit2 Bit7 RR Repair Mechanism

Row Repair Multiple Rows –Replace Specific Consecutive Number of Rows Starting at Even Row Address –Example: Two Rows Repair Unit

Row Repair Multiple Rows –Replace Specific Consecutive Number of Row starting at any Address –Example: Two Row Repair Unit C3 C0 C1 C2 r0 r4 r3 r2 r1 Q[7] Q[2] Q[1] Q[0] Q[6] C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 C3 C0 C1 C2 ColMux Memory IO Columns Bit0 Bit6 Bit1 Bit2 Bit7 RR

Row and Column Most Common ones –Two Columns/IOs –Multiple Rows Row may or may not Span the whole Memory Column may or may not span the whole memory