Question: Consider the following reference string given as WORD addresses: 1, 4, 8, 5, 20, 17, 19, 56, 9, 11, 4, 43, 5, 6, 9, 17.
Consider the following reference string given as WORD addresses: 1, 4, 8, 5, 20, 17, 19, 56, 9, 11, 4, 43, 5, 6, 9, 17.
Assume a Direct-Mapped cache with 16 one-word block frames that is initially empty. When this reference string is processed, label each reference as a Hit or Miss, and pictorially show the state 7 of the cache as each word address is processed. The state of the cache at the end should be the final state after the last word is processed.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
