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

Different ways in which a thread can be cancelled, What are the different w...

What are the different ways in which a thread can be cancelled? Cancellation of a target thread may happen in two different scenarios: Asynchronous cancellation: One thr

Could you replicate a multilevel directory structure, Q. Could you replica...

Q. Could you replicate a multilevel directory structure with a single-level directory structure in which arbitrarily long names can be used? If your answer is yes describe how you

Define jobs which are admitted to the system for processing, Define the Job...

Define the Jobs which are admitted to the system for processing is called The Jobs which are admitted to the system for processing is known as long-term scheduling.

What is a latency time, What is a Latency Time Latency Time is the time...

What is a Latency Time Latency Time is the time required through a sector to reach below read/write head.

Deadlock-avoidance safety algorithm, Q. Presume that you have coded the de...

Q. Presume that you have coded the deadlock-avoidance safety algorithm as well as now have been asked to implement the deadlock-detection algorithm. Can you do thus by simply usin

Hashed page table, Hashed page tables A common approach for handling ad...

Hashed page tables A common approach for handling address spaces larger than 32 bits is to use a hashed page table. Every entry in the hash table having a linked list of elemen

Hashed page table, W hat is hashed page table & method of hashed page tabl...

W hat is hashed page table & method of hashed page table with details

Use of c and c++, One reason to learn C and C++ is simply that so much soft...

One reason to learn C and C++ is simply that so much software is written in these languages. A related, butmore fundamental reason, is that C and C++ are relatively low-level, allo

Do ratio analysis of financial statements, Do ratio analysis by comparing t...

Do ratio analysis by comparing the four companies financial statements, analysis and interpretation on the four-basic group : (Refer to attachment A) Liquidity ratio Asset

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