Question

In this exercise, we will examine how replacement policies affect miss rate. Assume a two-way set associative cache with four one-word blocks. Consider the following word address sequence: 0, 1, 2, 3, 4, 2, 3, 4, 5, 6, 7, 0, 1, 2, 3, 4, 5, 6, 7, 0. Consider the following address sequence: 0, 2, 4, 8, 10, 12, 14, 16, 0

5.20.3 [5] <§§5.4, 5.8> Simulate a random replacement policy by flipping a coin. For example, "heads" means to evict the first block in a set and "tails" means to evict the second block in a set. How many hits does this address sequence exhibit?

Answer 1

dont relaly see if you can do this but mostly

Answer 2

Answer: Five hits

Explanation: The access sequence can be represented using: H, representing "head" and T representing "tail"

H T H T

0 1 2 3

0 1 2 3

0 2 3 4

4 5 6 7

4 5 6 7