0 votes 0 votes Discuss situations in which the most frequently used ($MFU$) 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 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes For loop access optimal and MRU has same performance with LRU and FIFO behaving in worst manner. If we access same frame say 1-10 then 10-1 (in reverse order), then LRU and FIFO behaves as optimal and MRU as worst. smsubham answered Mar 17, 2020 smsubham comment Share Follow See all 0 reply Please log in or register to add a comment.