0 votes 0 votes Discuss situations in which the least frequently used ($LFU$) page replacement algorithm generates fewer page faults than the least recently used ($LRU$) page-replacement algorithm. Also discuss under what circumstances the opposite holds. Operating System galvin operating-system virtual-memory descriptive + – akash.dinkar12 asked Mar 21, 2019 akash.dinkar12 552 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Consider the following sequence of memory accesses in a system that can hold four pages in memory: 1 1 2 3 4 5 1. When page 5 is accessed, the least frequently used page-replacement algorithm would replace a page other than 1, and therefore would not incur a page fault when page 1 is accessed again. On the other hand, for the sequence “1 2 3 4 5 2,” the least recently used algorithm performs better. Ref: CHAPTER 9 smsubham answered Mar 17, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.