Question: In which of the following algorithm it is possible to combat thrashing by increasing the value of alloc for each process?

Answer:

The virtual memory manager cannot use FIFO page replacement policy because increasing the allocation to a process may increase the page fault frequency of the process. This feature would make it difficult to combat thrashing in the system. However, when LRU page replacement is used, the number of page fault is nonincreasing function of alloc. Hence it is possible to combat thrashing by increasing the value of alloc for each process.

MCQ: In which of the following algorithm it is possible to combat thrashing by increasing the value of alloc for each process?

A. LRU Page replacement Algorithm
B. FIFO page replacement Algorithm
C. Optimal page replacement algorithm
D. NRU Page replacement algorithm

Correct Answer: A. LRU Page replacement Algorithm

Explanation:

The virtual memory manager cannot use FIFO page replacement policy because increasing the allocation to a process may increase the page fault frequency of the process. This feature would make it difficult to combat thrashing in the system. However, when LRU page replacement is used, the number of page fault is nonincreasing function of alloc. Hence it is possible to combat thrashing by increasing the value of alloc for each process.