Scribd
Upload
32 views4 pages

Computer Architecture Homework 5 - Due Date:08/11/2014: Class 11ECE Name

The document describes four problems related to cache memory organization and performance: 1) Simulating a direct-mapped cache with 16 blocks of 1 word each for a series of memory addresses. 2) Repeating problem 1 but with a direct-mapped cache of 4-word blocks and 16 word total capacity. 3) Repeating problem 1 with caches that are: a) 2-way set associative of 1-word blocks and b) fully associative of 1-word blocks. 4) Evaluating three cache configuration options for a new embedded processor based on miss rate, access time, layout, and required memory bits.

Uploaded by

VanlocTran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
32 views4 pages

Computer Architecture Homework 5 - Due Date:08/11/2014: Class 11ECE Name

The document describes four problems related to cache memory organization and performance: 1) Simulating a direct-mapped cache with 16 blocks of 1 word each for a series of memory addresses. 2) Repeating problem 1 but with a direct-mapped cache of 4-word blocks and 16 word total capacity. 3) Repeating problem 1 with caches that are: a) 2-way set associative of 1-word blocks and b) fully associative of 1-word blocks. 4) Evaluating three cache configuration options for a new embedded processor based on miss rate, access time, layout, and required memory bits.

Uploaded by

VanlocTran
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

Computer Architecture

Homework 5 Due Date:08/11/2014


1) This series of 32-bit WORD addresses is accessed (Memory with Word Addressing scheme):
2, 3, 11, 16, 21, 13, 64, 48, 19, 11, 3, 22, 4, 27, 6, 11
Assume a direct-mapped cache with 16 one-word blocks that is initially empty. Label each
address request and show the final contents of the cache.
Address

Hit or Miss

Block

11

16

21

13

64

48

19

11

10

22

11

12

27

13

14

11

15

Data at Address

Final contents of cache

Class 11ECE Name:

Page 1

2) Like Problem 1, but now assume that the cache is direct-mapped, 4-word blocks, total 16
word capacity.

Address

Block Address

Hit or Miss

Block

11

16

21

Data at Block

Final contents of cache

13
64
48
19
11
3
22
4
27
6
11

Class 11ECE Name:

Page 2

3) Like Problem 1, but assume that the cache is:


a. 2-way set associative, one-word blocks, total 16 word capacity
b. Fully associative, one-word blocks, total 16 word capacity
Assume a Least Recently Used (LRU) replacement policy where applicable.
Address
2
3
11
16
21
13
64
48
19
11
3
22
4
27
6
11

2-way SA H or M

Set
0
1
2
3
4
5
6
7

Data at Block

Address
2
3
11
16
21
13
64
48
19
11
3
22
4
27
6
11

FA H or M

Block
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15

Data at Block

Class 11ECE Name:

Data at Block

Page 3

4) We are designing a new embedded processor with word addressing scheme (32-bit) used
for main memory and we are trying to decide what kind of L1 cache to include in our
existing memory hierarchy (the L2 and main memory have already been designed. We
indicate the miss rate for all accesses that enter a given level). Our layout team has given
us the three options shown below:
Level 1 Cache
Type
8KB Fully-Associative
16 KB 4-way SA
16KB Direct Mapped

Write Policy
Write-Back
Write-Through,
Fetch-On-Write-Miss
Write-Back

Other Parts of Memory System


Type
Miss Rate
128 KB L2 Cache
2%
512 MB Main Memory
0%

Block Size
128 Bytes
64 Bytes

Miss Rate
10%
5%

Access Time
1 clock cycle
1 clock cycle

32 Bytes

8%

1 clock cycle

Access Time
10 clock cycles
100 clock cycles

For each:
a) Draw a picture showing how many rows and columns the cache has. Indicate the width of
each field including data, tag, and any necessary valid or dirty bits.
b) Calculate the number of memory bits required to implement each cache.
c) Calculate the average memory access time for the whole system with each cache.

Class 11ECE Name:

Page 4

You might also like