Caching Algorithms
Everything on SkillVeris tagged Caching Algorithms — collected across the glossary, study notes, blog, and cheat sheets.
5 resources across 1 library
Interview Questions(5)
What is the LRU Page Replacement Algorithm?
Least Recently Used (LRU) page replacement evicts the page that has gone the longest without being referenced, on the assumption that pages accessed far in the…
What is the FIFO Page Replacement Algorithm?
First-In-First-Out (FIFO) page replacement evicts the page that has been resident in memory the longest, regardless of how recently or frequently it has actual…
What is the Optimal (OPT/Belady’s) Page Replacement Algorithm?
The Optimal page replacement algorithm — also called OPT or Belady’s algorithm — evicts the page that will not be used for the longest time in the future, whic…
What is the Clock (Second-Chance) Page Replacement Algorithm?
The Clock algorithm, also called second-chance, approximates LRU cheaply by arranging resident pages in a circular list with a single reference bit each, sweep…
What is the LFU Page Replacement Algorithm?
Least Frequently Used (LFU) page replacement evicts the page with the smallest access count, on the assumption that pages referenced rarely overall are less va…