LRU page replacement algorithm

E1698805 UNEXPLORED

The LRU (Least Recently Used) page replacement algorithm is a memory management strategy that evicts the page that has not been accessed for the longest time, approximating optimal replacement by assuming recent past use predicts near-future use.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
LRU page replacement algorithm canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

WSClock page replacement algorithm → isComparedTo → LRU page replacement algorithm ⓘ