LRU-K evicts the page whose K-th most recent access is furthest in the past. For example, LRU-1 is simply LRU whereas LRU-2 evicts pages according to the time of their penultimate access. LRU-K improves greatly on LRU with regards to locality in time.
More information: Wiki, Scientific Article.
andreystrachuk / lru-k Goto Github PK
View Code? Open in Web Editor NEWThis project forked from sinyss/lru-k
Implementing LRU-K cache algorithm