Answer:
Also called FIFO anomaly. Usually, on increasing the number of frames allocated to a process virtual memory, the process execution is faster, because fewer page faults occur. Sometimes, the reverse happens, i.e., the execution time increases even when more frames are allocated to the process. This is Belady's Anomaly. This is true for certain page reference patterns.
Previous Question | Next Question |
What is the concept of Reentrancy? | Do you know what is a binary semaphore? What is its use? |