Could you demonstrate how you would implement an LRU cache policy in C++?

Question

Anonymous · Accepted Answer

Let us first try to understand what is LRU (Least Recently Used) policy in cache
replacement while the explanation also covers how i would implement it.
LRU is basically a small counter per block in a cache set.
To implement it there are two scenarios:
1. Cache hit:
If the access hits the cache ,increment the counters for the blocks whose
counters are less than the referenced blocks counter and set the referenced
blocks counter to zero.
2. Cache miss:
If the access misses in the cache,replace the Least Recently used Block and set
the newly allocated block counter to zero. Increment the counters of other
blocks.

Could you demonstrate how you would implement an LRU cache policy in C++?

Practice this question with AI

Go Premium

Practice More Questions

Community Answers

Unlock Community Insights