Pages live on the disk (back). A request goes from the CPU (front left); a miss loads the page into a RAM frame and evicts a victim chosen by the policy.
The science
Virtual memory maps pages onto F physical frames. A reference to a non-resident page is a page fault; with all frames full the policy must pick a victim.
FIFO evicts the oldest-loaded page. LRU evicts the page with the oldest last use. Clock keeps a reference bit per frame and a circular hand: a set bit is cleared (second chance), the first clear bit is evicted. Optimal (Belady's MIN) evicts argmax next_use(p); it needs the future, so it is a benchmark, not a real policy.
Belady's anomaly: for FIFO more frames can mean more faults: 1 2 3 4 1 2 5 1 2 3 4 5 gives 9 faults with 3 frames and 10 with 4. LRU and Optimal are stack algorithms (the F-frame set is always a subset of the (F+1)-frame set) so they cannot show it.
Simplifications: one process, fixed allocation, no dirty-bit write-back or prefetch; faults are counted, not timed (a real fault is ~104 to 106 times slower than a hit). Strings use a fixed seed so results repeat. Hardware model made in Blender; the algorithms run in plain JavaScript.