Explain fifo page replacement, Operating System

Assignment Help:

FIFO page replacement

This is the easiest page replacement algorithm. At this juncture the 1st page entering is the 1st to leave that is the oldest page leaves. To execute this we use a queue and the page at the head of the queue is the one being removed. The new page is put in at the tail of the queue. The disadvantage is that its performance isn't always good. 

Example, Consider a three frame memory and if the sequence in which pages come into the memory is 1,2,3,4,1 then 1,2,3 are entered into the memory in order. While the page 4 is required then 1 is removed as well as the new page 4 is inserted at the tail end with the head being 2. Now if 1 comes then 2 is detached as it is the new head.

 


Related Discussions:- Explain fifo page replacement

What is belady anomaly, What is Belady's anomaly When plotting on a g...

What is Belady's anomaly When plotting on a graph the page faults versus the number of available frames. We notice that the number of faults for four frames is greater than th

Give an overview of unix based file systems, Give an overview of UNIX based...

Give an overview of UNIX based file systems. UNIX and UNIX-like operating systems allocate a device name to each device, other than this isn't how the files on that device are

What is a buddy system?, What is a buddy system? We are dividing the me...

What is a buddy system? We are dividing the memory as powers of two therefore the division will be 2, 4, 8, 16, 32, 64, 128, 256...i.e. in powers of 2 as well as we are selecti

Briefly discuss on bankers algorithm, Briefly discuss on Bankers algorithm?...

Briefly discuss on Bankers algorithm? The resource-allocation graph algorithm is not applicable to a resource-allocation system with multiple examples  for each resource type.

Define program preemption, Define Program preemption The Forced de-allo...

Define Program preemption The Forced de-allocation of the CPU from a program which is executing on the CPU is known as Program preemption

Buffer, What is bounded buffer

What is bounded buffer

Determine a policy that is not valid page replacement policy, Determine a p...

Determine a policy that is not a valid page replacement policy?  RU policy (Recurrently used) is not a valid page replacement policy.

Define server processing with queues, Define Server Processing with Queues ...

Define Server Processing with Queues The efficient server processing of client request is essential for optimized client- server applications. This process is greatly enhanced

Digital circuits and design , 1. Draw a schematic diagram of a CMOS inverte...

1. Draw a schematic diagram of a CMOS inverter and explain its operation. 2. Draw schematic diagrams of CMOS NAND and NOR gates, and explain their operation. 3. Explain what

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