Question

1. (4 pt) Circle True or False. Each is 2 pts. t Recently Used (LRU) replacement policy generates better miss penalty than FIFO for fully- associative caches ngger b me rna 2. (8 pt) Find the Average Memory Access Time (AMAT) for a machine with following configuration: The machine has the hit rate of 95% with the hit time of 2 ns. A miss costs 30 ns to fetch the desired ume that the read and write miss penalties are the same and ignore other write stalls. data. Ass 3. (10 pt) A two-way set associate cache has 8 blocks and each block holds 4-byte of data. The memory system is byte-addressable. For each memory reference below, identify if it is hit or miss? Assume that the cache is initially empty. Reference 0 5 20 17 19 56911 43 17 H/M?

Answer 1

HOMEWORKLIB RULES: ONLY ONE QUESTION PER POST IS ALLOWED please ABIDE BY THE HOMEWORKLIB POLICY

POST FURTHER QUESTIONS ACCORDINGLY

SOLUTION

Question 1:

a) True, because the page that is recently used is generally the part of the program that is more likely to be used again so LRU results in better miss penalty than FIFO

b) True, because larger block sizes have the advantage of spatial locality so the miss penalty is reduced in cache having larger blocks

PLEASE RATE ! !

Thanks !