Explain Not recently used page replacement algorithm, Computer Engineering

Assignment Help:

Not Recently Used Page Replacement Algorithm

The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced, a referenced bit is set for that page, marking it as referenced. Likewise, while a page is modified (written to), a modified bit is set.  At a specific fixed time interval, the clock interrupt triggers and clears the referenced bit of all the pages, thus only pages referenced in the current clock interval are marked with a referenced bit. When a page requires to be replaced, the operating system categorizes the pages into four classes:

a) Class 0: not referenced, not modified 
b) Class 1: not referenced, modified 
c) Class 2: referenced, not modified 
d) Class 3: referenced, modified.

The NRU (Not recently used) algorithm picks a random page from the lowest category for removal. 


Related Discussions:- Explain Not recently used page replacement algorithm

Explain open-systems interconnections architecture model, Q. Explain Open-s...

Q. Explain Open-systems interconnections architecture model The most common network architecture model is the open-systems interconnections (OSI). Figure shows the ISO (Intern

What is interpreter, Q. What is interpreter? An interpreter translates ...

Q. What is interpreter? An interpreter translates each high-level-language statement into its equivalent set of machine-language instructions, which are then executed right awa

Automatic stock control system in a supermarket, Automatic Stock Control Sy...

Automatic Stock Control System in a Supermarket -  Bar codes are associated to all goods/items sold by the supermarket as a means of identification -  Every bar code is asso

Task gantt, The Task Gantt shows the various tasks being performed i.e., so...

The Task Gantt shows the various tasks being performed i.e., some type of activities by the set of processors attached to the parallel computer as shown in Figure . Task Gantt

What is chattering as applied to mechanical switches, What is chattering as...

What is chattering as applied to mechanical switches used in digital systems and why do they occur?  What is its effect on the functioning of a sequential circuit? Ans Chat

What is swapping, What is swapping?   A process can be swapped out tempo...

What is swapping?   A process can be swapped out temporarily of memory to a backing store and after that brought back in memory for execution as continued.

Define emulation, Define emulation. Given a computer with a particular ...

Define emulation. Given a computer with a particular instruction set, it is possible to explain additional machine instructions and execute them with extra micro routines. Emul

What must the requirement of designer to get memory capacity, In applicatio...

In applications where the required memory capacity cannot be satisfied by a single available memory IC chip, what should the designer do to meet this requirement? Ans: If th

Which of the memories stores the most number of bits, Which of the memories...

Which of the memories stores the most number of bits ? Ans. most number of bits stores in 32M x 8 As 2 5 x 2 20   = 2 25 Therefore 1M = 2 20 = 1K x 1K = 2 10 x 2 10

How race around condition can be avoided, How Race Around Condition can...

How Race Around Condition can be avoided? Ans: The race around condition can be avoided if 1. Duration of clock pulse being high is small like comparative to the dela

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