Ask Question
7 August, 10:27

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] 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?

+5
Answers (2)
  1. 7 August, 10:45
    0
    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
  2. 7 August, 10:48
    0
    Dont relaly see if you can do this but mostly
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “In this exercise, we will examine how replacement policies affect miss rate. Assume a two-way set associative cache with four one-word ...” in 📗 Engineering if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Search for Other Answers