1 votes 1 votes Is Most Recently Used (MRU) Page replacement algorithm a 'Stack Algorithm' i.e. it doesn't suffer from Belady's Anomaly ? Operating System operating-system al + – VS asked Jan 23, 2018 VS 1.2k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply joshi_nitish commented Jan 23, 2018 reply Follow Share no, MRU doesn't suffer from Belady's anamoly. 0 votes 0 votes Anu007 commented Jan 23, 2018 reply Follow Share An algorithm which used some idea(either using history or future.) to replace a page then it does not suffer from Belady anamoly or have stack algorithm. 4 votes 4 votes VS commented Jan 24, 2018 reply Follow Share @Anu007 sir Any reference? Its still not very clear to me :( Why MRU is a stack algo ? 0 votes 0 votes abhishek tiwary commented Jan 24, 2018 reply Follow Share https://cseweb.ucsd.edu/classes/sp02/cse120_B/stack.html 0 votes 0 votes Anu007 commented Jan 24, 2018 reply Follow Share A stack page replacement policy is a policy that assigns a priority to a page that is independent of the number of page frames. https://cseweb.ucsd.edu/classes/sp02/cse120_B/stack.html they talk about LFU and LRU. https://en.wikipedia.org/wiki/Page_replacement_algorithm Read here in Heading Least Recently Used 3 votes 3 votes Please log in or register to add a comment.
