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

Sector sparing, What is sector sparing is proper definition

What is sector sparing is proper definition

Define the sleep (sec) function, Define the Sleep (sec) Function Sleep ...

Define the Sleep (sec) Function Sleep function suspends execution of this process for sec number of seconds. While this function is used in our example for consistency, other f

WINDOWS XP, DESIGN GOALS OF WINDOWS XP.DESCRIBE IN DETAIL.

DESIGN GOALS OF WINDOWS XP.DESCRIBE IN DETAIL.

What is micro-kernel?, Question 1 What is Micro-kernel? What are the benef...

Question 1 What is Micro-kernel? What are the benefits of Micro-kernel? Question 2 Explain seven state process models used for OS with necessary diagram. Differentiate betwee

Paging, Paging full question

Paging full question

Operating system components, Question 1 Discuss the following with respect ...

Question 1 Discuss the following with respect to Operating Systems: Operating System Components Operating System Services Question 2 Describe the theory behind Pagin

What are a safe state and an unsafe state, What are a safe state and an uns...

What are a safe state and an unsafe state? Answer:  A state is safe if the system can allocate resources to every process in some order and still avoid a deadlock. A system is

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