Explain optimal page replacement algorithm, Computer Engineering

Assignment Help:

Optimal Page Replacement Algorithm

The optimal page replacement algorithm that as well known as OPT is an algorithm which works as follows: while a page needs to be swapped in, operating system swaps out the page whose next use will take place farthest in the future. For instance, a page that is not going to be utilized for the next 6 seconds will be swapped out over a page that is going to be utilized in next 0.4 seconds.


Related Discussions:- Explain optimal page replacement algorithm

What is difference between cobol and vs cobol ii, In using COBOL on PC we h...

In using COBOL on PC we have only flat files and the programs can access only limited storage, while in VS COBOL II on M/F the programs can access up to 16MB or 2GB depending on th

What is commitment unit, What is commitment unit? When out-of-order exe...

What is commitment unit? When out-of-order execution is permitted, a special control unit is required to guarantee in-order commitment. This is known as the commitment unit. It

Calculating block size - computer architecture, Calculating Block Size: ...

Calculating Block Size: B A unit of associatively -one tag for B A words B T unit of transfer-B T words to/from primary memory as a unit             One valid bit for

Show the main drawback of cav disk, Q. Show the main drawback of CAV disk? ...

Q. Show the main drawback of CAV disk? The main drawback of CAV disk is that a lot of storage space is wasted because longer outer tracks are storing data only equal to the sho

Show the layout of dvorak-dealey keyboard, Q. Show the layout of Dvorak-Dea...

Q. Show the layout of Dvorak-Dealey keyboard? This was one keyboard layout designed to be a challenger to QWERTY layout. This was designed by August Dvorak and William Dealey a

What is imprecise and precise exception, What is imprecise and precise exce...

What is imprecise and precise exception? Situation in which one or more of the succeeding instructions have been implemented to completion is known as imprecise exception. Situ

Determine the begin - end keywords, Determine the begin - end keywords ...

Determine the begin - end keywords Group several statements together. Cause the statements to be evaluated sequentially (one at a time) -> Any timing within sequential group

Ease of learning - user friendliness, Ease of Learning - User Friendliness ...

Ease of Learning - User Friendliness Much has been made recently of increasing sophistication in technology with one of the major benefits advertised as an increase in somethi

What is script-fu in gimp, Sript-Fu is the first GIMP scripting extension. ...

Sript-Fu is the first GIMP scripting extension. Extensions are split processes that communicate with the GIMP in the similar way that plug-ins do. The distinction is that extension

Why timing signal distributor required, Q. Why Timing Signal Distributor r...

Q. Why Timing Signal Distributor required? What do you mean by Memory Cycle? How many Memory Cycles required for following instructions: 1. ADD 2. CLEAR and ADD 3. DC

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