Explain FIFO page replacement algorithm, Computer Engineering

Assignment Help:

Explain FIFO Page replacement algorithm.

FIFO policy: This policy only removes pages in the order they entered in the main memory. By using this policy we simply eliminate a page based upon the time of its arrival in the memory. For illustration if we have the reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 and 3 frames here 3 pages can be in memory at a time per process, after that we have 9 page faults as demonstrated:

277_9 page faults.png


If frames are increased say to 4, after that number of page faults also arises, to 10 in this case.

116_10 pages faults.png


Related Discussions:- Explain FIFO page replacement algorithm

Determine the ad hoc testing, Determine the Ad hoc testing - It is a ty...

Determine the Ad hoc testing - It is a type of testing which is performed without the use of planning or/and documentation. - These tests are run only one time unless a defe

State about the indirect addressing, Indirect addressing A memory locat...

Indirect addressing A memory location is given that holds another memory location. This second memory location holds the real data. This mechanism solves problems caused by rea

What can digital circuits do?, Circuits can be designed to implement a spec...

Circuits can be designed to implement a specifictaske.g. a simple circuit could compare two inputvoltages and give a high output if they matched anda low output if they did not mat

What are the update types possible, What are the update types possible? ...

What are the update types possible? The following update types are possible: Update type A: The matchcode data is updated asynchronously to database changes. Update

What do you call an event and when do you call an assertion, What do you ca...

What do you call an event and when do you call an assertion? Assertion based Verification Tools, checks whether a statement holds a explained  property or not, while, Event bas

Ida* search - artificial intelligence, IDA* Search - artificial intelligenc...

IDA* Search - artificial intelligence: A* search is a sophisticated and successful search strategy. In fact, a problem with A* search is that it must keep all states in its me

What do you understand by electronic funds transfer, What do you understand...

What do you understand by Electronic Funds Transfer?  Electronic Funds Transfer: It's an electronic payment method that transfers the money value from one bank account to

Hyper-threading, Hyper-threading, officially known as Hyper-threading Techn...

Hyper-threading, officially known as Hyper-threading Technology (HTT), is Intel's trademark for their execution of the simultaneous multithreading technology on the Pentium 4 micro

Example on distribution of data, Q. Example on Distribution of Data? !H...

Q. Example on Distribution of Data? !HPF$ PROCESSORS P1(4) !HPF$ TEMPLATE T1(18) !HPF$ DISTRIBUTE T1(BLOCK) ONTO P1  Consequently of these instructions distribution of

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