Assume lru replacement policy for each sequence how many


We have a 2-way set-associative cache has two entries. The size of the block in the cache is one word. Consider the following address sequences(word address)
A 0,2,4,0,2,4,0,2,4
B 1,0,2,4,2,2,2,4,0,2
Assume LRU replacement policy, for each sequence, how many hits does the sequence exhibit?

Request for Solution File

Ask an Expert for Answer!!
Basic Computer Science: Assume lru replacement policy for each sequence how many
Reference No:- TGS0646880

Expected delivery within 24 Hours