Explain lru approximation page replacement, Operating System

Assignment Help:

LRU approximation page replacement

In this we are able to use the reference bit associated with the page entry to choose a page to be removed. The various algorithms used for the implementation is discussed below.

a. Second chance Algorithm

When a page is selected the reference bit is checked to see whether it has been referenced before. If that is the case afterward it is given a second chance. The page is moved as of head to tail and its reference bit is made 0. If it hasn't been referenced then it is removed.

Example Consider 1,2,3,4,3,5,6. Now 1, 2, 3 are entered in to memory and when 4 comes 1 is removed. While 5 come 2 is removed. While 6 come 4 is removed instead of 3 as 3 has been referenced in between.

b. Enhanced Second chance algorithm

In this a modify bit is as well used. Now if the ordered pair of reference and modify is

(0,0) neither recently used nor modified - the best page to replace.

(1,1) both referenced and modified- the worst to  replace

(1,0) referenced but not modified

(0,1) not recently used but modified.

This algorithm is utilized in the Macintosh virtual memory management scheme.

c. Additional Reference bits algorithm

Here we keep an 8-bit byte for every page in memory. At standard intervals the reference bit is shifted by the OS. If a shift register contains 00000000 then the page hasn't been used for the last 8 time periods. A page with a history 11000000 is more recently used than 01000000. The no of bits are able to be varied accordingly to the needs of the OS.


Related Discussions:- Explain lru approximation page replacement

What are the deadlock prevention methodologies?, What are the deadlock p r...

What are the deadlock p revention methodologies? a.       Necessitate that processes request all resources before starting - if cannot be granted don't run. b.      Process

All the explanations of operating system and its types., operating systems ...

operating systems and its types together with its design issues and their examples.

Explain the exitthread function used in the windows nt, Explain the ExitThr...

Explain the ExitThread Function used in the Windows NT ExitThread(ExitCode) The ExitThread( ) call is made to end the currently running thread. If the current thread is th

Explain the protection problems, Q. In some systems a subdirectory is able...

Q. In some systems a subdirectory is able to be read and written by an authorized user just as ordinary files can be. a. Explain the protection problems that could arise. b.

Unix, what is difference between file descriptor and file pointer?

what is difference between file descriptor and file pointer?

List the four steps that are essential to run a program, List the four step...

List the four steps that are essential to run a program on a completely dedicated machine. a. Reserve machine time. b. Manually load program into memory. c. Load starting

Cpu, what is cpu

what is cpu

Calculate maximum average bandwidth, You have a system with two primary wor...

You have a system with two primary workloads. One performs sequential access to a set of large files, the other performs small, independent, random reads to a separate set of large

Discuss distributed file system caching, Problem: (a) Discuss Distribut...

Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c

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