Grokking System Design Fundamentals
Ask Author
Back to course home

0% completed

Cache Replacement Policies

When implementing caching, it’s important to have a cache replacement policy to determine which items in the cache should be removed when the cache becomes full. Here are some of the most common cache replacement policies:

1. Least Recently Used (LRU)

LRU is a cache replacement policy that removes the least recently used item from the cache when it becomes full. This policy assumes that items that have been accessed more recently are more likely to be accessed again in the future.




Like the course? Get enrolled and start learning!