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

Non repudiation, What is non-repudiation? how can it be achieved in designi...

What is non-repudiation? how can it be achieved in designing e-cash based system?

Sql injection, SQL Injection includes entering SQL code into web forms, eg....

SQL Injection includes entering SQL code into web forms, eg. login fields, or into the browser address field, to access and manipulate the database across the site, application or

Explain the term - integrity, Explain the term - Integrity In most c...

Explain the term - Integrity In most cases, corporate data should remain unchanged by third parties, so the system should be capable of ensuring that only authorised personn

How do you ensure that our records are scanned accurately, How do you ensur...

How do you ensure that our records are scanned accurately? Not only do we have a highly trained and capable staff, we also have quality controls in place to make sure your reco

Explain garbage collection, Explain Garbage collection In this method ...

Explain Garbage collection In this method two passes are made over the memory to identify new areas. In the first pass it traverses all pointers pointing to allocated areas an

Two properties of recursion, Two properties of recursion are:- 1. A sm...

Two properties of recursion are:- 1. A smallest, base case that is processed without recursion and acts as decision criterion for stopping the method of computation and 2.

How can you pass a struct by reference in e, How can you pass a struct by r...

How can you pass a struct by reference in e?   The question is phrased in a tricky way because passing by reference is the default and only possible way to pass structs in e. I

What is file scope, Explain File scope File scope: The variables and ...

Explain File scope File scope: The variables and functions with file scope appear outside any block or list of parameters and are accessible from any place in the translation

How many octets does smallest possible ipv6 datagram contain, How many Octe...

How many Octets does the smallest possible IPV6 datagram contain? The maximum size of an Ipv6 datagram is 65575 bytes, with the 0 bytes Ipv6 header. Ipv6 also describe a minim

Basic working of semiconductors, Q. Basic working of Semiconductors? Se...

Q. Basic working of Semiconductors? Semiconductors are crystalline solid materials whose resistivities have values between those of conductors and insulators. Conductivity rang

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