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

State about the harvard mark I and the bug, Harvard mark i and the bug ...

Harvard mark i and the bug The next important effort towards devising an electromechanical computer was done at the harvard University, jointly sponsored by the Department of U

Single instruction and multiple data stream (simd), Single Instruction and ...

Single Instruction and Multiple Data stream (SIMD) In this organisation, multiple processing elements are working under the control of a one control unit. It has multiple data

Find farthest distance from exchange where subscriber locate, An exchange u...

An exchange uses a -40 V battery to drive subscriber lines. A resistance of 250 ohms is placed in series with the battery to protect it from short circuits. The subscribers are req

What is redefines clause, Redefines clause is used to permit the similar st...

Redefines clause is used to permit the similar storage allocation to be referenced by dissimilar data names.

Explain the configuration of a step-by-step switching system, With neat dia...

With neat diagrams explains the configuration of a step-by-step switching system. The schematic diagram for an exchange is specified in figure. Each subscriber is associated to

Example of prolog, Example of Prolog: We can say that this is also tru...

Example of Prolog: We can say that this is also true if there are four even numbers. Now we have our first rule: • If there are three or four even numbered cards, such play

How to design a sequential circuit, A sequential circuit is signified by a ...

A sequential circuit is signified by a time sequence of external inputs, external outputs and internal flip-flop binary states. So firstly a state diagram and state table is used t

Define throughput, Define throughput?  Throughput in CPU scheduling is ...

Define throughput?  Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for s

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