Page Replacement
Everything on SkillVeris tagged Page Replacement — collected across the glossary, study notes, blog, and cheat sheets.
11 resources across 1 library
Interview Questions(11)
What is Demand Paging?
Demand paging is a virtual memory technique where a page is loaded into physical memory only when a process actually references it, rather than loading the who…
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…
What is Belady’s Anomaly?
Belady’s Anomaly is the counter-intuitive situation where increasing the number of page frames available to a process actually increases the number of page fau…
What is Swapping in Operating Systems?
Swapping is the OS technique of moving an entire process or individual memory pages out of physical RAM to a reserved area of disk (the swap space) to free up…
What is the Working Set Model?
The working set model defines a process's working set as the set of pages it has referenced within a recent time window (delta), and the OS uses this to decide…
What is the Dirty Bit in Paging?
The dirty bit (also called the modified bit) is a single flag in each page table entry that the hardware sets whenever a process writes to that page in memory,…
What is the Reference Bit in Paging?
The reference bit (also called the accessed bit) is a single flag in each page table entry that the hardware sets whenever a page is read or written, giving th…