Scribd
Upload
78 views

Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples

The document discusses virtual memory and demand paging. It describes how virtual memory separates logical memory from physical memory, allowing processes to have an address space larger than physical RAM. Demand paging brings pages into memory only when needed, reducing I/O. When a page is accessed that is not in memory, a page fault occurs and the OS selects a frame to load the page into. If no frame is free, it uses a page replacement algorithm like FIFO or LRU to select a page to remove from memory. The document also discusses thrashing which is excessive paging that reduces performance.

Uploaded by

Ujjawal Mallik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
78 views

Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples

The document discusses virtual memory and demand paging. It describes how virtual memory separates logical memory from physical memory, allowing processes to have an address space larger than physical RAM. Demand paging brings pages into memory only when needed, reducing I/O. When a page is accessed that is not in memory, a page fault occurs and the OS selects a frame to load the page into. If no frame is free, it uses a page replacement algorithm like FIFO or LRU to select a page to remove from memory. The document also discusses thrashing which is excessive paging that reduces performance.

Uploaded by

Ujjawal Mallik
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 21

Chapter 10: Virtual Memory

Background
Demand Paging
Process Creation
Page Replacement
Allocation of Frames
Thrashing
Operating System Examples

Operating System Concepts 10.1 Silberschatz, Galvin and Gagne 2002


Background

Virtual memory separation of user logical


memory from physical memory.
Only part of the program needs to be in memory
for execution.
Logical address space can therefore be much
larger than physical address space.
Allows address spaces to be shared by several
processes.
Allows for more efficient process creation.

Virtual memory can be implemented via:


Demand paging
Demand segmentation

Operating System Concepts 10.2 Silberschatz, Galvin and Gagne 2002


Virtual Memory That is Larger Than Physical
Memory

Operating System Concepts 10.3 Silberschatz, Galvin and Gagne 2002


Demand Paging

Bring a page into memory only when it is


needed.
Less I/O needed
Less memory needed
Faster response
More users

Page is needed reference to it


invalid reference abort
not-in-memory bring to memory

Operating System Concepts 10.4 Silberschatz, Galvin and Gagne 2002


Transfer of a Paged Memory to Contiguous Disk
Space

Operating System Concepts 10.5 Silberschatz, Galvin and Gagne 2002


Valid-Invalid Bit
With each page table entry a validinvalid bit is associated
(1 in-memory, 0 not-in-memory)
Initially validinvalid but is set to 0 on all entries.
Example of a page table snapshot.

Frame # valid-invalid bit


1
1
1
1
0
During address translation,
if validinvalid bit in page table
entry is 0 page fault.
0
0
page table

Operating System Concepts 10.6 Silberschatz, Galvin and Gagne 2002


Page Table When Some Pages Are Not in Main
Memory

Operating System Concepts 10.7 Silberschatz, Galvin and Gagne 2002


Page Fault

If there is ever a reference to a page, first reference will trap


to
OS page fault
OS looks at another table to decide:
Invalid reference abort.
Just not in memory.
Get empty frame.
Swap page into frame.
Reset tables, validation bit = 1.
Restart instruction: Least Recently Used
block move

auto increment/decrement location

Operating System Concepts 10.8 Silberschatz, Galvin and Gagne 2002


Steps in Handling a Page Fault

Operating System Concepts 10.9 Silberschatz, Galvin and Gagne 2002


What happens if there is no free
frame?

Page replacement find some page in


memory, but not really in use, swap it out.
algorithm
performance want an algorithm which will
result in minimum number of page faults.

Same page may be brought into memory


several times.

Operating System Concepts 10.10 Silberschatz, Galvin and Gagne 2002


Performance of Demand Paging

Page Fault Rate 0 p 1.0


if p = 0 no page faults
if p = 1, every reference is a fault

Effective Access Time (EAT)


EAT = (1 p) x memory access
+ p (page fault overhead
+ [swap page out ]
+ swap page in
+ restart overhead)

Operating System Concepts 10.11 Silberschatz, Galvin and Gagne 2002


Basic Page Replacement

1. Find the location of the desired page on disk.

2. Find a free frame:


- If there is a free frame, use it.
- If there is no free frame, use a page
replacement algorithm to select a victim
frame.

3. Read the desired page into the (newly) free


frame. Update the page and frame tables.

4. Restart the process.

Operating System Concepts 10.15 Silberschatz, Galvin and Gagne 2002


Page Replacement Algorithms

Want lowest page-fault rate.


Evaluate algorithm by running it on a
particular string of memory references
(reference string) and computing the number
of page faults on that string.
In all our examples, the reference string is
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5.

Operating System Concepts 10.17 Silberschatz, Galvin and Gagne 2002


First-In-First-Out (FIFO) Algorithm
Reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
3 frames (3 pages can be in memory at a time per process)

1 1 4 5
2 2 1 3 9 page faults
4 frames
3 3 2 4

1 1 5 4
2 2 1 5 10 page faults
FIFO Replacement Beladys Anomaly
3 page
more frames less 3 2faults

4 4 3

Operating System Concepts 10.18 Silberschatz, Galvin and Gagne 2002


FIFO Page Replacement

Operating System Concepts 10.19 Silberschatz, Galvin and Gagne 2002


Optimal Algorithm

Replace page that will not be used for longest period


of time.
4 frames example
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5

1 4
2 6 page faults
3

How do you know 4 5


this?
Used for measuring how well your algorithm performs.

Operating System Concepts 10.20 Silberschatz, Galvin and Gagne 2002


Optimal Page Replacement

Operating System Concepts 10.21 Silberschatz, Galvin and Gagne 2002


Least Recently Used (LRU)
Algorithm
Reference string: 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5

1 5

3 5 4
4 3
Counter implementation
Every page entry has a counter; every time page is
referenced through this entry, copy the clock into
the counter.
When a page needs to be changed, look at the
counters to determine which are to change.

Operating System Concepts 10.22 Silberschatz, Galvin and Gagne 2002


LRU Page Replacement

Operating System Concepts 10.23 Silberschatz, Galvin and Gagne 2002


Thrashing

If a process does not have enough pages,


the page-fault rate is very high. This leads to:
low CPU utilization.
operating system thinks that it needs to
increase the degree of multiprogramming.
another process added to the system.

Thrashing a process is busy swapping pages


in and out.

Operating System Concepts 10.24 Silberschatz, Galvin and Gagne 2002


Thrashing

Why does paging work?


Locality model
Process migrates from one locality to another.
Localities may overlap.
Why does thrashing occur?
size of locality > total memory size

Operating System Concepts 10.25 Silberschatz, Galvin and Gagne 2002

You might also like