Square Memory Performance and Hamming Code for Error Detection and Correction, Exercises of Computer Architecture and Organization

The benefits of fast page-modes in square-memory implementations for improving cache miss performance. Additionally, it covers hamming code for one-bit error detection and correction in 8-bit data. Instructions for calculating hamming codewords and explains how to detect and correct errors.

Typology: Exercises

2012/2013

Uploaded on 05/06/2013

anurati
anurati 🇮🇳

4.2

(24)

121 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1 Square-memory implementations of large memories often support fast page-modes that allow a burst of consecutive
memory reads from within the same row of the square memory.
a) How does this benefit performance on a cache miss?
b) An additional improvement allows the processor to specify a different ordering of the consecutive memory reads.
For example, a processor might specify a burst of size 4 reads with offsets of 2-3-0-1 from the specified memory
address. How does this benefit performance on a cache miss?
2 a) For the 8-bit data 01001011
2
develop the Hamming codeword for one-bit error detection and correction:
121+241+42+41+2+481+82+81+2+84+8
11010010
C
1
C
2
D
0
C
4
D
1
D
2
D
3
C
8
D
4
D
5
D
6
D
7
123456789101112
Check bit C
1
looks at bit positions 3, 5, 7, 9, and 11
Check bit C
2
looks at bit positions 3, 6, 7, 10, and 11
Check bit C
4
looks at bit positions 5, 6, 7, and 12
Check bit C
8
looks at bit positions 9, 10, 11, and 12
b) If bit D
5
gets flipped (an error), then how would we be able to detect an error?
c) If bit D
5
gets flipped (an error), then how would we be able to know which bit to correct?
d) For the 8-bit data 11001001
2
develop the Hamming codeword for one-bit error detection and correction:
121+241+42+41+2+481+82+81+2+84+8
11010010
C
1
C
2
D
0
C
4
D
1
D
2
D
3
C
8
D
4
D
5
D
6
D
7
123456789101112
Name:___________________
Lecture 17 - 1
Docsity.com

Partial preview of the text

Download Square Memory Performance and Hamming Code for Error Detection and Correction and more Exercises Computer Architecture and Organization in PDF only on Docsity!

1 Square-memory implementations of large memories often support fast page-modes that allow a burst of consecutive memory reads from within the same row of the square memory. a) How does this benefit performance on a cache miss?

b) An additional improvement allows the processor to specify a different ordering of the consecutive memory reads. For example, a processor might specify a burst of size 4 reads with offsets of 2-3-0-1 from the specified memory address. How does this benefit performance on a cache miss?

2 a) For the 8-bit data 01001011 2 develop the Hamming codeword for one-bit error detection and correction:

D 7 D 6 D 5 D 4 C 8 D 3 D 2 D 1 C 4 D 0 C 2 C 1

Check bit C 1 looks at bit positions 3, 5, 7, 9, and 11 Check bit C 2 looks at bit positions 3, 6, 7, 10, and 11 Check bit C 4 looks at bit positions 5, 6, 7, and 12 Check bit C 8 looks at bit positions 9, 10, 11, and 12

b) If bit D 5 gets flipped (an error), then how would we be able to detect an error?

c) If bit D 5 gets flipped (an error), then how would we be able to know which bit to correct?

d) For the 8-bit data 11001001 2 develop the Hamming codeword for one-bit error detection and correction:

D 7 D 6 D 5 D 4 C 8 D 3 D 2 D 1 C 4 D 0 C 2 C 1

Name:___________________

Lecture 17 - 1

Docsity.com