This topic is a video lesson inside the Page Replacement & Thrashing module. The goal is not to memorize the title: reconstruct the problem it solves, the mechanism that makes it work, and the signal that tells you when to use it.
Remember the shape, not the sentence
“When memory is full, eviction policy IS performance.”
What problem does this solve?
Start from the engineering problem rather than the definition. Optimal, FIFO (and Belady's anomaly), LRU, clock exists because a system needs a reliable way to handle a recurring constraint inside Page Replacement & Thrashing. Ask what would become slow, ambiguous, unsafe, or impossible without it.
How the mechanism works
Break the idea into observable steps. The useful mental model is: input → transformation → decision or state change → output. Keep each step small enough that you can redraw it from memory. The surrounding module is the context: When memory is full, eviction policy IS performance.
When to reach for it
Use nearby concepts as contrasts. In this module, compare Optimal, FIFO (and Belady's anomaly), LRU, clock with Working sets, locality and thrashing, Interactive: run reference strings through FIFO vs LRU, Count page faults for 3 policies (by hand). The distinction matters because good engineering choices depend on the constraints, not on memorizing isolated definitions.
See the mechanism before you memorize it
One diagram, one causal story, one reconstruction task.
Optimal, FIFO (and Belady's anomaly), LRU, clock — causal map
Frame
State the problem and the constraints before naming the technique.
Transform
Apply the core mechanism of Optimal, FIFO (and Belady's anomaly), LRU, clock and track what state changes.
Observe
Inspect the artifact, output, invariant, or behavior produced by the mechanism.
Transfer
Explain where the same idea appears elsewhere in Operating Systems.
Draw the idea yourself
Rebuild the core flow on a real canvas before moving to the worked walkthrough.
Walk the system
Frame
State the problem and the constraints before naming the technique.
Transform
Apply the core mechanism of Optimal, FIFO (and Belady's anomaly), LRU, clock and track what state changes.
Observe
Inspect the artifact, output, invariant, or behavior produced by the mechanism.
Transfer
Explain where the same idea appears elsewhere in Operating Systems.
Reconstruction card
Use the card as a generative note, not a summary to copy. Fill it from memory after the explanation.
TOPIC: Optimal, FIFO (and Belady's anomaly), LRU, clock
MODULE: Page Replacement & Thrashing
TYPE: video lesson
PROMPT
What problem does it solve?
What changes step by step?
What evidence proves it worked?
When would you choose something else?What usually goes wrong
Close the tab. Rebuild it from memory.
Read the question, answer aloud, then reveal.
What problem is Optimal, FIFO (and Belady's anomaly), LRU, clock designed to solve?Reveal answer
It addresses a recurring constraint inside Page Replacement & Thrashing. A strong answer names the input, the core mechanism, and the result rather than repeating the title.
What are the four stages of the mental model?Reveal answer
Frame the problem → transform the input/state → observe the evidence → transfer the idea to a new scenario.
What is thrashing and its real cause?Reveal answer
The system spends more time paging than executing: combined working sets exceed RAM, so every reference faults. Fix: reduce multiprogramming or add memory.
Make this idea travel.
Connect it next to: What an OS actually does: abstraction + arbitration • User mode vs kernel mode, rings, and the syscall path • Interactive: trace a read() from C code to disk • Interrupts, traps and the timer that keeps processes honest.