Scribd
Upload
7 views

Operating System

The document discusses page replacement algorithms used in operating systems. When a program requests a page that is not in physical memory, a page fault occurs and the OS must select a page to replace. Common algorithms discussed include First In First Out (FIFO), which replaces the oldest page; Optimal, which replaces the page that will not be used for the longest time; Least Recently Used (LRU), which replaces the least recently used page; and Most Recently Used, which replaces the most recently used page. The goal of page replacement algorithms is to minimize page faults.

Uploaded by

carmelkankeu7
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Operating System

The document discusses page replacement algorithms used in operating systems. When a program requests a page that is not in physical memory, a page fault occurs and the OS must select a page to replace. Common algorithms discussed include First In First Out (FIFO), which replaces the oldest page; Optimal, which replaces the page that will not be used for the longest time; Least Recently Used (LRU), which replaces the least recently used page; and Most Recently Used, which replaces the most recently used page. The goal of page replacement algorithms is to minimize page faults.

Uploaded by

carmelkankeu7
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Operating system

In an operating system that uses paging for project management a place replacement algorithm is
needed beside which page needs to be replaced when a new page comes.

A PAGE FAULT. Happens when a running program accesses a running page that is mapped into a
virtual address space but not only in physical memory. Since actual memory is much more smaller
than physical memory page fault happens. In case of a page fault operating system might have
replace one of the existing pages with the newly needed page. Different page replacement algo
suggest different ways beside which page to replace, A target of all algorithms.

1. FIFO: This is the simplest page replacement algorithm the operating system keeps tracks of
all pages in the queue. Example consider the page reference with 3 page frames 1,3,0,3,5,6,3
find the number of page fault.
2. OPTIMAL PAGE REPLACEMENT: In this algorithm pages are replaced according to the number
of time. Optimal page replacement is perfect and the use of optimal page replacement is to
set up a bench mark so other replacement algorithm can be analyse.
3. LEAST RECENTLY USE: in this algo page will replace which is least recently use .
4. Most recently use

You might also like