The page replacement policy that some times leads to more page faults when the size of the memory is increased, is
The page replacement policy that some times leads to more page faults when the size of the memory is increased, is
The correct option is A FIFO
The page replacement policy that sometimes
leads to more page faults when the size of the memory is increased, is FIFO.
Page replacement algorithm:-
In an operating systems that use paging
for memory management, page replacement algorithm are needed to decide which
page needed to be replaced when new page comes in. Whenever a new page is
referred and not present in memory, page fault occurs and Operating System
replaces one of the existing pages with newly needed page. Different page
replacement algorithms suggest different ways to decide which page to replace. The
target for all algorithms is to reduce number of page faults.
Page Fault – A page fault is a type of interrupt, raised by the
hardware when a running program accesses a memory page that is mapped into the
virtual address space, but not loaded in physical memory.
First In First Out (FIFO) –
This is the simplest page replacement algorithm. In this
algorithm, operating system keeps track of all pages in the memory in a queue,
oldest page is in the front of the queue. When a page needs to be replaced page
in the front of the queue is selected for removal.
The page replacement policy that sometimes leads to more page faults when the size of the memory is increased, is FIFO.
Page replacement algorithm:-
In an operating systems that use paging for memory management, page replacement algorithm are needed to decide which page needed to be replaced when new page comes in. Whenever a new page is referred and not present in memory, page fault occurs and Operating System replaces one of the existing pages with newly needed page. Different page replacement algorithms suggest different ways to decide which page to replace. The target for all algorithms is to reduce number of page faults.
Page Fault – A page fault is a type of interrupt, raised by the hardware when a running program accesses a memory page that is mapped into the virtual address space, but not loaded in physical memory.
First In First Out (FIFO) –
This is the simplest page replacement algorithm. In this
algorithm, operating system keeps track of all pages in the memory in a queue,
oldest page is in the front of the queue. When a page needs to be replaced page
in the front of the queue is selected for removal.
