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

Calculate width and height of the grid, Given a cell, we must determine its...

Given a cell, we must determine its neighbouring cells i.e. those with which it shares a wall. The cells with an x are the neighbours of the cell c. Write the function getneighbour

Approach to reasoning - first-order logic, Approach to reasoning - first-or...

Approach to reasoning - first-order logic: The formal approach to reasoning has bigger return and disadvantages. In generally we notice, if a computer program has proved somet

What is the relation between response time and throughput, The Throughput g...

The Throughput graph represents the amount of data in bytes that the Vusers received from the server in a second. When we evaluate this with the transaction response time, we will

Define alphabet and string, Define Alphabet and String? A finite set of...

Define Alphabet and String? A finite set of symbols is termed as alphabet. An alphabet is frequently signified by sigma, yet can be specified any name. B = {0, 1} here B is

Avoiding overfitting - decision tree learning , Avoiding Overfitting : ...

Avoiding Overfitting : However remember there that in the previous lecture, there is over fitting that common problem in machine learning. Furthermore details to decision tree

Smart card & e-cash, Smart Card & E-Cash E-cash storable smart cards ca...

Smart Card & E-Cash E-cash storable smart cards can kept and dispense cash electronically, making bills and coins lesser essential. It transfers funds over phone lines, making

What is java applet, A Applet is a java program that runs within a web brow...

A Applet is a java program that runs within a web browser.

What is jmx, JMX is native to the Java programming language. As a result, i...

JMX is native to the Java programming language. As a result, it offers natural, efficient, and lightweight management extensions to Java-based functions. It has of a set of specifi

Explain the advantages of object oriented analysis design, Advantages of Ob...

Advantages of Object oriented analysis design The OO approach inherently makes every object a standalone component which can be reused within specific stat problem domains we

Select-options and parameters statement, The fields specified by select-opt...

The fields specified by select-options and parameters statement cannot be grouped together in the selection screen.  No, It can be grouped together in the selection screen

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