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

How is basic authentication worked, How is basic authentication worked? ...

How is basic authentication worked? When an exact resource has been protected using fundamental authentication, Apache sends a 401 Authentication needed header along with the r

Nature of intelligence, From the early AI pioneering stage the research ...

From the early AI pioneering stage the research emphasis has been on developing machines with intelligent behaviour. Machine intelligence however is hard to achieve. Some

Analysis of sort bitonic, Analysis of Sort_Bitonic(X) The bitonic sorti...

Analysis of Sort_Bitonic(X) The bitonic sorting network needs log n number of phases for performing task of sorting the numbers. The first n-1 phases of circuit can sort two n/

Slower layer to a faster layer, Given a four level hierarchical storage sys...

Given a four level hierarchical storage system consisting of: cache,  primary storage, secondary storage, and tertiary storage. Suppose the following:  programs may be executed on

What are the basic features of supply chain management, What are the basic ...

What are the basic features of Supply Chain Management? Features of Supply Chain Management Supply Chain Management uses different methods to find out, affect and chang

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

What are the input for uml development, What are the Input for UML developm...

What are the Input for UML development UML is an attempt to standardize artefacts of analysis and design consisting of semantic models, diagrams and syntactic notations. The fi

Dynamic programming problem, KK manufacturing company is faced with demand ...

KK manufacturing company is faced with demand for its product in each of the next four periods as shown in Table 1.  It must decide upon a production schedule to meet these demands

What is a binary tree, What is a binary tree? A binary tree 'T' is desc...

What is a binary tree? A binary tree 'T' is described as A finite set of elements, known as nodes, such that: either (i) or (ii) happens: (i) T is empty (known as the 'nu

Adbms, what are the different way of executing pipelines

what are the different way of executing pipelines

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