Price your future right. 60% off with code BLACKSCHOLES at USD checkout. Offer ends in 8d 09h 54m 24s8 days 9 hours 54 minutes 24 seconds.
Price your future right. 60% off with code BLACKSCHOLES at USD checkout. Offer ends in 8d 09h 54m 24s8 days 9 hours 54 minutes 24 seconds.

Sign in to watch this lesson
Memory Virtualization · 4:46
When physical memory is full, the kernel must choose a page to send back to disk, and with a disk 100,000 times slower than RAM every miss counts (AMAT). We run Belady's optimal policy, FIFO, random and LRU on the book's stream, reproduce Belady's anomaly and the stack property, and plot hit-rate curves from a simulator, including the looping workload where LRU hits nothing. Then clock and use bits, preferring clean pages, thrashing and Linux's OOM killer.