(Solved) : 7 Set Associative Memory Suppose Four Lines Per Set Want Use Lru Replacement Algorithm Min Q44129958 . . .
LRU – LRU is Least Recently Used.
7. In a set-associative memory suppose I have four lines per set. I want to use LRU as the replacement algorithm. What is the minimum number of bits I need to add to each line to implement LRU? Show transcribed image text 7. In a set-associative memory suppose I have four lines per set. I want to use LRU as the replacement algorithm. What is the minimum number of bits I need to add to each line to implement LRU?
Expert Answer
Answer to 7. In a set-associative memory suppose I have four lines per set. I want to use LRU as the replacement algorithm. What i…
OR