The document discusses virtual memory, which separates user logical memory from physical memory, allowing only a portion of a process to reside in memory while the rest is stored on disk. It outlines the advantages, such as improved processing speed and support for multiprogramming, as well as disadvantages, including decreased performance and system stability. Various page replacement algorithms like FIFO and LRU are explained, highlighting their mechanisms and effectiveness.

1. Present by :-
Ritul De

2. CONTENTS
 Introduction
 Advantages of Virtual Memory
 Disadvantage ofVirtual Memory
 FIFO
 LRU
 Page Replacement Algorithms
 OPT

3. Introduction
 Virtual memory is a separation of user logical memory from physical
memory.
 In this method, we keep only a part of the process in the memory and other
part on the disk (secondary storage)

4.  Only part of the program needs to be in memory for execution.
 Logical address space is much larger than physical address space.
 Need to allow pages to be swapped in and out.
 Virtual memory allows speed gain when only a particular segment of the program
is required for the execution of the program.
 This concept is very helpful in implementing multiprogramming environment.

5.  Applications run slower if the system is using virtual memory.
 ItTakes more time to switch between applications.
 Less hard drive space for your use.
 It reduces system stability.

6.  It is the technique used by operating system to decide which
memory pages swap out .
 It is also decided that is memory , how much frames to allocate
to each process.

7. First In First Out (FIFO) Algorithm
 Very simple to implement
 Oldest page is replaced for replacement
 Performance is not always good
1
2
3
4
2
3
4
1
3
4
1
2
5
1
2
5
3
2
5
3
4
4 1 2 5 3 4

8.  Page which has not been used for the longest time in main
memory the one which will be selected for replacement.
 It is like optimal page-replacement algorithm looking backwards
in time.
7
0
1
2
0
1
2
0
3
4
0
3
4
0
2
4
3
2
2 4 2 3

9.  Looks for page in future
 Lowest page fault
 Difficult to implement
7
0
1
2
0
1
7
0
1
2
0
1
2
0
3
2
0
3
2
4
3
2 3 4 0 1 7