計算機結構與作業系統

Under pure demand paging, a process may begin execution without any page loaded in physical memory and immediately incur a page fault on its first instruction fetch.

The optimal page replacement algorithm cannot be implemented in practice as it requires future knowledge of page references.

A page replacement algorithm that satisfies the stack property cannot suffer from the Belady's anomaly.

If the total demand for frames, computed as the summation of all processes' working-set sizes, exceeds the number of available physical frames, the system may enter a thrashing state.

Compared to global page replacement, local page replacement generally provides more predictable per-process performance at the cost of lower overall system throughput.