Explain lru page replacement in detail, Operating System

Assignment Help:

LRU page replacement

In least lately used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an optimal page replacement algorithm looking backward in time. It is considered as a good performer. 

There are two methods for execution that are counter and stack. Counter is the easiest to execute in which with each page entry there is a counter or logical clock. For every memory reference it is incremented. We reinstate the page with the smallest time value. In this overflow should be considered, in stack memory allocation when a page is referenced it is removed from the stack and put on top. For the reason that the entries may be in middle it is implemented using doubly linked list.

Example Consider the string 1,2,3,4,3,2,1. In this 1, 2, 3 are inserted as normal as 4 comes it is entered in the position of 1. When 1 comes again 4 is put back as it is the least referenced.

 

 


Related Discussions:- Explain lru page replacement in detail

Illustrate scope of consumer behaviour, Q. Illustrate Scope of Consumer beh...

Q. Illustrate Scope of Consumer behaviour ? Scope of consumer behaviour is extremely wide due to following reasons: >>Ever rising intensifying competition. >>Additional a

Is disk scheduling except fcfs scheduling, Q. Is disk scheduling except FC...

Q. Is disk scheduling except FCFS scheduling useful in a single-user environment? describe your answer. Answer: In a single-user environment the I/O queue typically is empty.

Build a vigorous distributed system, Q.  To build a vigorous distributed sy...

Q.  To build a vigorous distributed system you must know what kinds of failures can occur. a. List three possible kinds of failure in a distributed system. b. State which of

Reference counting, The idea of reference counting is to maintain, for ever...

The idea of reference counting is to maintain, for every object, the total number of references to that object, i.e. the number of "incoming" pointers. Whenever the number of refer

What are race conditions?, What are race conditions? Race conditions ar...

What are race conditions? Race conditions are problems that take place due to the sharing of the same file by several processes. In such a case none of the processes is able to

Computer, what is an operating system?

what is an operating system?

Nested Macro calls, . Nested Macro calls are expanded using the

. Nested Macro calls are expanded using the

Write a short note about the different states of a process, Write a short n...

Write a short note about the different STATES of a process. As a process implement it changes state. The state of a process is described in part by the current activity of that

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd