OPSYS 1 Group 5: Virtual Memory Fundamentals

Page replacement becomes necessary when a page fault occurs and there are free page frames in memory.

The optimal page replacement algorithm replaces a page that will be needed for the longest period of time in the future.

The first-in-first-out (FIFO) page replacement algorithm selects the most recently used page for removal.

Page replacement is only necessary when a new page comes in and there are free page frames in memory.

The least recently used (LRU) page replacement algorithm replaces a page that is most likely to be referenced in the immediate future.

Page replacement algorithms are only needed when a page fault occurs and the replaced page is referenced again.

Virtual memory is a technique used to manage physical memory more efficiently.

Demand paging is a technique used to load entire programs into memory at once.

Copy on write is a technique used to manage page faults in virtual memory.

Page replacement is a mechanism used to manage physical memory.

Virtual memory allows programs to run as if they have access to a small, continuous block of memory.

Demand paging is based on the principle of loading entire programs into memory at once.

In the MRU algorithm, the page that will be replaced is the one that has been used least recently.

Belady's anomaly can occur in the MRU algorithm.

Thrashing occurs when the system has an excess of physical memory.

Thrashing is a desirable scenario in operating systems because it improves system performance.

Thrashing occurs when the system is under a light workload.