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

Functions - first-order logic, Functions - first-order logic: Function...

Functions - first-order logic: Functions can be thought of as exceptional predicates, wherever we think of all but one of the arguments as input and the output as final argume

How does tcp achieve reliability, How does TCP achieve reliability? One...

How does TCP achieve reliability? One of the most significant technologies is retransmission. While TCP stands data the sender compensates for packet loss through implementing

Write an interrupt routine to handle division by zero, Q. Write an interrup...

Q. Write an interrupt routine to handle 'division by zero'? This file can be loaded just like a COM file though makes itself permanently resident until the system is running.

What is busy hour traffic, Busy hour traffic is the (A)  maximum avera...

Busy hour traffic is the (A)  maximum average simultaneous traffic. (B)  traffic during peak hour. (C)  traffic when all subscribers are engaged. (D)  the durat

How physical addressing is performed in wan, How physical addressing is per...

How physical addressing is performed in WAN?  WAN networks operate as similar to a LAN. All WAN technology describes the specific frame format a computer uses while sending an

Define the term ''turn-around'', The "turn-around" time of a user job is th...

The "turn-around" time of a user job is the? Ans. Total time taken to execute the job is called "turn around" time.

Prior conditions - logic programs, Prior Conditions - Logic programs: ...

Prior Conditions - Logic programs: However firstly there we must make sure that our problem has a solution. Whether one of the negative examples can be proved to be true from

Hazard in pipeline - computer architecture, Hazard in pipeline - computer a...

Hazard in pipeline - computer architecture: A hazard in pipeline .-removing a hazard frequently need that some instructions in the pipeline to be permitted to proceed as othe

What is collective message passing, Q. What is Collective Message Passing? ...

Q. What is Collective Message Passing? In collective message passing all the processes of a group take part in communication. MPI offers a number of functions to apply the coll

Where can i find conference information, Georg Thimm handles a webpage that...

Georg Thimm handles a webpage that lets you search for upcoming or past conferences in a range of AI disciplines.

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