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

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 is null pointer, What is NULL POINTER Inside main, a FILE * called...

What is NULL POINTER Inside main, a FILE * called file. Afterwards, the fopen function, passing it the path to data file, as well as "r", only intending to read from the file.

What are the advantages of using xml over html, What are the advantages of ...

What are the advantages of using XML over HTML?  The root cause of the problem lies in HTML (Hyper Text Mark-up Language), the defacto standard for web publication. The main pr

What is a virtual address, Q. What is a virtual address? Von Neumann ha...

Q. What is a virtual address? Von Neumann had suggested that execution of a program is possible only if program and data are residing in memory. In such a condition program len

Marked statement is implemented , Consider the ReadRear Java method (a)...

Consider the ReadRear Java method (a) Illustrate pictures that explain the data structure every time a checkpoint is reached for the problems of sizes one, two, three and four s

Input, what is an input?

what is an input?

Explain about communication displays and matrix, Q. What is communication D...

Q. What is communication Displays and Matrix? Communication Displays Communication displays offer support in concluding frequency of communication whether congestion in me

What are superscalar processors, What are superscalar processors? Sever...

What are superscalar processors? Several instructions start implementation in the same clock cycle, and the processor is said to use multiple issue. Such processors are capable

Find out the number of control lines for 32 to 1 multiplexer, The number of...

The number of control lines for 32 to 1 multiplexer is ? Ans. For 32 (2 5 ) the number of control lines and to select one i/p between them total 5 select lines are needed.

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