AKT211 – CAO 08 – Computer Memory (2)

Slides:



Advertisements
Presentasi serupa
1 Algoritma Bahasa Pemrograman dan Bab 1.1. Pengertian Algoritma.
Advertisements

Chapter 5 Internal Memory
2. Introduction to Algorithm and Programming
Alg&Pemrog 2B Sistem Komputer Variable  Variable dapat didefinisikan sebagai bagian dari memory untuk menyimpan nilai yang telah ditentukan.  Setiap.
Fungsi Lecture 7. Motivation Complexity of programming problem  more difficult to consider the solution as a whole  clue: dividing the problem into.
RANGKAIAN LOGIKA KOMBINASIONAL
K-Map Using different rules and properties in Boolean algebra can simplify Boolean equations May involve many of rules / properties during simplification.
1 DATA STRUCTURE “ STACK” SHINTA P STMIK MDP APRIL 2011.
BAGIAN III Lapisan Data Link.
BLACK BOX TESTING.
Presented By : Group 2. A solution of an equation in two variables of the form. Ax + By = C and Ax + By + C = 0 A and B are not both zero, is an ordered.
Testing Implementasi Sistem Oleh :Rifiana Arief, SKom, MMSI
1 Diselesaikan Oleh KOMPUTER Langkah-langkah harus tersusun secara LOGIS dan Efisien agar dapat menyelesaikan tugas dengan benar dan efisien. ALGORITMA.
Ruang Contoh dan Peluang Pertemuan 05
Memory and Storage Chapter 24 Subject: Digital System Year: 2009.
Floating Point (Multiplication)
Masalah Transportasi II (Transportation Problem II)
1 Pertemuan 10 Fungsi Kepekatan Khusus Matakuliah: I0134 – Metode Statistika Tahun: 2007.
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Lapisan Data Link BAGIAN III.
Pertemuan 07 Peluang Beberapa Sebaran Khusus Peubah Acak Kontinu
Layer Data Link Pertemuan 13 Matakuliah: H0484/Jaringan Komputer Tahun: 2007.
HAMPIRAN NUMERIK SOLUSI PERSAMAAN NIRLANJAR Pertemuan 3
1 Pertemuan 15 Game Playing Matakuliah: T0264/Intelijensia Semu Tahun: Juli 2006 Versi: 2/1.
1 HAMPIRAN NUMERIK SOLUSI PERSAMAAN LANJAR Pertemuan 5 Matakuliah: K0342 / Metode Numerik I Tahun: 2006 TIK:Mahasiswa dapat meghitung nilai hampiran numerik.
1 Minggu 10, Pertemuan 20 Normalization (cont.) Matakuliah: T0206-Sistem Basisdata Tahun: 2005 Versi: 1.0/0.0.
1 Pertemuan > > Matakuliah: >/ > Tahun: > Versi: >
13 Akuntansi Biaya Activity Based Costing
9.3 Geometric Sequences and Series. Objective To find specified terms and the common ratio in a geometric sequence. To find the partial sum of a geometric.
Chapter 10 – The Design of Feedback Control Systems PID Compensation Networks.
OPERATOR DAN FUNGSI MATEMATIK. Operator  Assignment operator Assignment operator (operator pengerjaan) menggunakan simbol titik dua diikuti oleh tanda.
Keuangan dan Akuntansi Proyek Modul 2: BASIC TOOLS CHRISTIONO UTOMO, Ph.D. Bidang Manajemen Proyek ITS 2011.
KOMUNIKASI DATA Materi Pertemuan 8.
Teknik. Pemrog. Terstruktur 2
KOMUNIKASI DATA Materi Pertemuan 3.
OPERASI PERKALIAN.
Konsep pemrograman LOOP
ERROR CORRECTION.
Kode Hamming.
KOMUNIKASI DATA S. Indriani L, M.T
ORGANISASI dan ARSITEKTUR KOMPUTER
Pengujian Hipotesis (I) Pertemuan 11
CPU ARITHMATIC.
VECTOR VECTOR IN PLANE.
Pertemuan <<18>> << Penemuan Fakta(01) >>
Pertemuan VI MAPPING FUNCTION.
BILANGAN REAL BILANGAN BERPANGKAT.
Algorithms and Programming Searching
Two-and Three-Dimentional Motion (Kinematic)
REAL NUMBERS EKSPONENT NUMBERS.
Open and Closed Social Stratification
Recursive function.
Defri Kurniawan DATA STORAGE Defri Kurniawan
ACCUMULATION PROBLEMS
Teknik Modulasi Pertemuan 07
Master data Management
Database User Account.
Things You Need to Know Before Running on the Beach.
Teknik. Pemrog. Terstruktur 2
THE INFORMATION ABOUT HEALTH INSURANCE IN AUSTRALIA.
Lesson 2-1 Conditional Statements 1 Lesson 2-1 Conditional Statements.
HughesNet was founded in 1971 and it is headquartered in Germantown, Maryland. It is a provider of satellite-based communications services. Hughesnet.
 Zoho Mail offers easy options to migrate data from G Suite or Gmail accounts. All s, contacts, and calendar or other important data can be imported.
By Yulius Suprianto Macroeconomics | 02 Maret 2019 Chapter-5: The Standard of Living Over Time and A Cross Countries Source: http//
Right, indonesia is a wonderful country who rich in power energy not only in term of number but also diversity. Energy needs in indonesia are increasingly.
Al Muizzuddin F Matematika Ekonomi Lanjutan 2013
Vector. A VECTOR can describe anything that has both MAGNITUDE and DIRECTION The MAGNITUDE describes the size of the vector. The DIRECTION tells you where.
Draw a picture that shows where the knife, fork, spoon, and napkin are placed in a table setting.
By Group 5. Once upon a time a lion was roaming in the jungle in search of a prey. Luckily, he saw a rabbit sleeping fast under a tree. He was delighted.
Wednesday/ September,  There are lots of problems with trade ◦ There may be some ways that some governments can make things better by intervening.
Transcript presentasi:

AKT211 – CAO 08 – Computer Memory (2) Ghifar Parahyangan Catholic University Okt 31, 2011

Last Course Review Computer Memory System RAM Basic Technology Memory Characteristics Memory Hierarchy RAM Basic Technology Semiconductor SRAM vs DRAM Advanced RAM Organization SDRAM vs DDR-RAM

Outline Error Correction Single error correction Double error correction

THE BASIC OF ERROR CORRECTION

Semiconductor System Error Hard Failures Permanent physical defect so that it can’t reliably store data Stuck at 0 or 1 or switch erratically between 0 and 1 Soft Error Random, nondestructive event that alters the contents of one or more cell without damaging the memory Caused by power supply problems or alpha particles Most modern main memory systems include logic for both detecting and correcting errors

Single-bit error Only 1 bit in data unit has changed

Error Correcting Code (ECC) Function

Simples form of Error Detection Using a parity bit A bit that is added to ensure that the number of bits with the value ‘1’ in a set of bits is even or odd Only for detecting 1-bit error, not more, nor correcting ! E.g.: no error E.g.: 1 bit error A wants to transmit: 1001 A computes parity bit value : 1^0^0^1 = 0 A adds parity bit and sends : 10010 B receives : 10010 B computes parity : 1^0^0^1 = 0 B reports correct transmission after observing expected result A wants to transmit: 1001 A computes parity bit value : 1^0^0^1 = 0 A adds parity bit and sends : 10010 *** TRANSMISION ERROR *** B receives : 11010 B computes parity : 1^1^0^1 = 1 B reports incorrect transmission after observing unexpected result

Hamming Error-Correcting Code linear error-correcting code can detect up to d-1 bit errors can correct (d-1)/2 d is the minimum hamming distance between all pairs in the code words

Hamming (7, 4) Code encodes 4 data bits (d1, d2, d3, d4) into 7 bits by adding 3 parity bits (p1, p2, p3) single error correction

Hamming (7,4) Example

HAMMING ALGORITHM GENERALIZATION FOR SINGLE ERROR CORRECTION

Generalization of the Hamming Single Error Correction The comparison logic receives as input two K-bit values A bit-by-bit comparison is done by taking the XOR The result is called the syndrome word The value 0 indicates that no error was detected and otherwise We can determine the position from that syndrome word

Required criteria for Hamming Error Correction If the syndrome contains all 0s, no error has been detected If the syndrome contains one and only one bit set to 1, then an error has occurred in one of the n check bits. No correction is needed If the syndrome contains more than one bit set to 1, then numerical value of the syndrome indicates the position of the data bit in error

SEC Step-by-Step Determine how long the code (check bits) must be Determine the stored position for each bit in M data bits and K check bits Construct the appropriate XOR function that match with the required criteria

1. Determine how long the code must be M : number of bits in data bits K : number of bits in code bits Because an error could occur on any of the M data bits or K check bits, we must have : e.g.: for a word of 8 data bits (M=8), we have 2K – 1 ‹ M + K K=3 : 23 – 1 < 8 + 3 K=4 : 24 – 1 > 8 + 4

2. Determine the stored position Let’s see the explanation ! 

3. Construct the XOR Function Again, let’s see the explanation ! 

Hamming SEC-DED Code Nowadays, more commonly, semiconductor memory is equipped with a single-error-correcting, double-error-detecting (SEC-DED) code Needs 1 extra parity bit that indicates whether the total number of 1s is even or odd Enhances the reliability of the memory, but adds the cost of complexity E.g. : The IBM 30xx implementations used an 8-bit SEC-DED code for each 64 bits of data in main memory The size is actually about 12% larger than is apparent to the user

Hamming SEC-DED Code (2)

Any Question ?

Reference Chapter 5.2: Error Correction (Stallings, William. Computer Organization and Architecture, 8th ed. Prentice Hall. 2010)

Exercises Dengan penggunaan algoritma Hamming, berapakah jumlah check bit yang dibutuhkan jika data bit berukuran 1024-bit ? Terdapat data bit sebanyak 8-bit tersimpan di dalam memori yang isinya 11000010. Dengan menggunakan algoritma Hamming, tentukan nilai check bit yang akan tersimpan pada memori. Untuk data word 8-bit 00111001, check bit yang tersimpan adalah 0111. Anggap terjadi error pada pembacaan memori. Ketika data bit tersebut di baca ulang dari memori, nilai check bit yang terhitung adalah 1101. Berapakah sebenarnya nilai data bit yang error?

Week 8 Assignment Bentuklah persamaan XOR untuk menentukan SEC code (check bit) dengan menggunakan algoritma Hamming untuk data bit berukuran 16-bit. Bagaimana hasil check bit apabila menerima masukan data bit 0101000000111001 ? Simulasikan bagaimana algoritma Hamming dapat mengoreksi error apabila terjadi error di data bit posisi ke-5 (0101000000101001). Jelaskan jawaban Anda selengkap-lengkapnya.

THANK YOU