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

Semaphores, how do semaphores help us in eliminating deadlock conditions?

how do semaphores help us in eliminating deadlock conditions?

What are the benefits of multiprogramming?, What are the benefits of multip...

What are the benefits of multiprogramming? Responsiveness : Multithreading is an interactive application may permit a program to continue running even if part of it is block

Explain components of conflict phase of dispatch latency, Explain Component...

Explain Components of conflict phase of dispatch latency The conflict phase of dispatch latency has two components 1. Preemption of any process running in the kernel. 2.

Explain message passing among systems, Q. Explain Message passing among sys...

Q. Explain Message passing among systems? Communications- Message passing among systems requires messages to be turned into packets of information and sent to the network contr

Write a short note about schedulers, Write a short note about schedulers. ...

Write a short note about schedulers. Processes migrate between the various scheduling queues throughout its life time. The operating system should select for scheduling purpose

Describe the three levels of data abstraction, There are three kinds of D...

There are three kinds of Data Abstraction: Physical level: The minimum level of abstraction defines how data are saved. Logical level: The next bigger level of a

What are the issues in designing a network, Normal 0 false fa...

Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Define inter process communication (ipc), The term IPC (Inter-Process Commu...

The term IPC (Inter-Process Communication) defines several paths by which different process executing on some operating system interact between each other.

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

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