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 are the variations in a fast adder, a. Design a fast adder. What are t...

a. Design a fast adder. What are the variations in a fast adder? b. Define how the virtual address is changed into real address in a paged virtual memory system. Give an example

Rational performance of an agent - artificial intelligence, Rational perfor...

Rational performance of an agent - artificial intelligence: To summarize, an agent takes input from its violence and affects that environment. The rational performance of an a

What is static timing, What is Static timing a. Delays over all paths a...

What is Static timing a. Delays over all paths are added up. b. All possibilities, including false paths, verified without the need for test vectors. c. Faster than simul

Input-output-processor interconnection network (iopin), Input-Output-Proces...

Input-Output-Processor Interconnection Network (IOPIN) This interconnection network is used for communication between I/O channels and processors. All processors commune with a

Various interconnection networks-fully connected, Various Interconnection N...

Various Interconnection Networks Fully connected: This is the most controlling interconnection topology.In this each node is directly linked to all other nodes. The shortcomi

How is EISA bus different from ISA bus, How is EISA bus different from ISA ...

How is EISA bus different from ISA bus? Extended Industry Standard Architecture (EISA) is a 32 bit modification to ISA bus. As computers became larger and had wider data buses,

How did you find web server related issues, Using Web resource monitors we ...

Using Web resource monitors we can search the performance of web servers. Using these monitors we can examine throughput on the web server, number of hits per second that happened

Prove the equations using the boolean algebraic theorems, Prove the equatio...

Prove the equations A + A‾ .B + A.B‾ = A + B using the Boolean algebraic theorems ? Ans. The equation is A + A‾.B + A.B‾ = A + B L.H.S. = A + A‾ .B + A.B‾ = (A + A.B‾) + A‾.B

Signaling pvm process, Q. Signaling PVM process? int pvm_sendsig( ...

Q. Signaling PVM process? int pvm_sendsig( int tid, int signum ) Transmits a signal to other PVM process. tid is task identifier of PVM process to receive signal.

What is assembly condition codes, Condition codes are the list of possible ...

Condition codes are the list of possible conditions that can be tested through conditional instructions. Typical conditional instructions have: conditional branches, conditional ju

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