Explain fifo page replacement in detail, Operating System

Assignment Help:

FIFO page replacement

This is the easiest page replacement algorithm. Here the 1st page toward the inside 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 drawback is that its performance is not 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. When the page 4 is required after that 1 is removed and the new page 4 is inserted at the tail end with the head being 2. Now if 1 comes after that 2 is removed as it is the new head.

 


Related Discussions:- Explain fifo page replacement in detail

Process destruction, Most process abstractions support processes being dest...

Most process abstractions support processes being destroyed when the program terminates, or in response to a specific kill directive. There are two common implementations, one a "p

Define ageing, Define Ageing Ageing is a method of enhancing the priori...

Define Ageing Ageing is a method of enhancing the priority of process waiting in Queue for CPU allocation

Micro operation, Ask question maxmum words accepted#

Ask question maxmum words accepted#

What is a thread, What is a thread? A thread or else called a lightweig...

What is a thread? A thread or else called a lightweight process (LWP) is a basic unit of CPU utilization, it comprises of a thread id, a program counter, a register set and a s

Explain what isam, Explain what ISAM is. Indexed sequential access meth...

Explain what ISAM is. Indexed sequential access method. The file is stored in sorted order. ISAM has a master index file, indicating in what part of another index file the key

What is the purpose of system calls, Q. What is the purpose of system calls...

Q. What is the purpose of system calls? Answer: System calls permit user-level processes to request services of the operating system.

Is it essential to bind a real-time thread to an lwp, Q. Presume an operati...

Q. Presume an operating system maps user-level threads to the kernel using the many-to-many model and the mapping is done through LWPs. Additionally the system allows developers to

Define dynamic loading, Define dynamic loading. To obtain better memory...

Define dynamic loading. To obtain better memory-space utilization dynamic loading is used. With dynamic loading, a routine is not loaded until it is called. All routines are ke

Memory management, diffenciet between least recently used and not recently ...

diffenciet between least recently used and not recently used

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