IT Learning Made Simple
Aug 31, 2026 · Fundamentals
Page Replacement Algorithms: Who Gets Kicked Out When Memory Is Full?
When a device runs out of RAM, page replacement algorithms decide which pages to evict; the article defines page replacement, outlines goals, compares OPT, FIFO, LRU and their approximations, explains the Belady anomaly, and shows real‑world uses in Linux, JVM GC, and Redis.
Belady anomalyClock algorithmFIFO
0 likes · 9 min read
