The Gateway to Computer Science Excellence
+3 votes
Self doubt:

What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
in Operating System by Active (1.2k points) | 135 views

1 Answer

+2 votes
Best answer

My definition about LRU is Replace the page which one is Long-ago Used

1) no.of pages already loaded in the memory

              given reference string is 1,2,4,5,6,1,2,3..... using demand-paging said  that already two pages brought in main memory 1 ,2 and 1 is brought before 2


           in the reference string very first 1 and 2 are hits but not the page faults 

2) which page is long-ago used

            given reference string is 1,2,4,5,6,1,2,3..... think each reference is in different month first 1 is in jan, first 2 is in feb, 4 is in mar, 5 is in apr, 6 is in may, second 1 is June , second 2 is in July etc... if a hit occurs consider the page respective month is updated to new one ( 1 is June and 2 is July in this example ). if a page fault occurs replace the page with which have long-ago referred...

by Veteran (65.6k points)
selected by

Related questions

+1 vote
1 answer
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,279 answers
104,840 users