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

Telecommunications, with poisson arrival of two calls per minute what is th...

with poisson arrival of two calls per minute what is the probability that more than three calls will arrive in two minutes? that is the time during which at least 4 calls will arr

How the at-user command serves mainly in lists, How the at-user command ser...

How the at-user command serves mainly in lists? The AT USER-COMMAND event serves mostly to handle own function codes.  In this case, you should make an individual interface wit

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

Write a short note on pointer operators in c, Write a short note on pointer...

Write a short note on pointer operators in c Pointers (that is, pointer values) are generated with the ''address-of'' operator &, which we can also think of as the ''pointer-to

what respects the advance builds, Describe your choice specifically and fu...

Describe your choice specifically and fully, explaining and discussing at length in what respects the advance builds upon or departs from present technology or practice and the sev

What do you mean by shared memory, Q. What do you mean by Shared Memory? ...

Q. What do you mean by Shared Memory? In shared memory scheme more focus is on controlling parallelism instead of data parallelism. In this model numerous processes run indepen

Send a report to the printer, How to send a report to the printer instead o...

How to send a report to the printer instead of displaying it on the screen? We can send a report to the printer instead of displaying it on the screen.  To do this, use the key

Representation in prolog - logic programs, Representation in Prolog - Logic...

Representation in Prolog - Logic Programs: If we justimpose some additional constraints on first-order logic, so than we get to a representation language knowing as logic prog

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