7-OS Virtual Memory

Memory Management
|

(OS: Operating Systems) | (Memory Management) | 1
Virtual Memory
Background
Demand Paging
Process Creation
Page Replacement
Allocation of Frames
Thrashing
Operating System Examples
|

Learning Objectives

(demand paging)
|


Background

(
)
single program
overlay
(sub program)
Multiprogram
(virtual memory) OS
|


Background
2 main program
Sub
Program
|


Background
(Virtual memory)
(logical memory)
(physical memory)
(execution)
(Logical address) (physical address
space)

Virtual memory
Demand paging
Demand segmentation
|

Virtual Memory That is Larger Than Physical Memory
|

Demand Paging
page
(Less I/O needed)

(Less memory needed)
(Faster response)
(More users)
Page
invalid reference (abort)
not-in-memory (bring to memory)
|

Transfer of a Paged Memory to Contiguous Disk Space
|

Valid-Invalid Bit
validinvalid bit page table

(1 in-memory, 0 not-in-memory)
validinvalid 0 (entries)
Example of a page table snapshot.
Frame #
valid-invalid bit
1
1
1
1
0
validinvalid
bit page table entry 0 page
fault
0
0
page table
|

Page Table When Some Pages Are Not in Main Memory
|

Page Fault
page trap to OS
page fault
OS
Invalid reference abort.

empty frame
Swap page frame
Reset tables, validation bit = 1.
: Least Recently Used
block move
|

Steps in Handling a Page Fault
|

(free frame)?
Page (Page replacement)

page
(swap out)
algorithm
performance algorithm
(page)
|

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)
|

Demand Paging Example

Memory access time = 1 microsecond
50% page
Swap Page Time = 10 msec = 10,000 msec

EAT = (1 p) x 1 + p (15000)
1 + 15000P (in msec)
|


Process Creation
Virtual memory

- Copy-on-Write
- Memory-Mapped Files
|

Copy-on-Write
Copy-on-Write (COW) parent and child
processes share page
page page

COW page

Free pages pool zeroed-out pages.
|

Memory-Mapped Files
Memory-mapped file I/O file I/O

mapping a disk block page
demand paging page-sized

physical page. reads/writes
treating file I/O read() write() system

calls.
map pages
|

Memory Mapped Files
|


Page Replacement
page-fault
service routine page replacement
modify (dirty) bit overhead

Page replacement logical
memory physical memory virtual memory
physical memory
|

Need For Page Replacement
|

Basic Page Replacement

1. page
2. free frame:
- free frame
- free frame page replacement
algorithm victim frame
3. page free frame Update
page frame
4.
|

Page Replacement
|

Page Replacement Algorithms

(lowest page-fault
rate)
algorithm reference string
page faults string
In all our examples, the reference string is
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5.
|

Graph of Page Faults Versus The Number of Frames
|

First-In-First-Out
Algorithm
Reference string: 1, 2, 3, 4, 1, 2, 5,(FIFO)
1, 2, 3, 4, 5
3 frames (3 pages )
4 frames
9 page faults
1 1 5 4
FIFO Replacement Beladys Anomaly
frames page faults 2

2
1 5 10 page faults
3
|

FIFO Page Replacement
|

FIFO Illustrating Beladys Anamoly
|

Optimal Algorithm
page
4 frames example
1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
1
6 page faults
3
4

|

Optimal Page Replacement
|

Least Recently Used (LRU) Algorithm

Reference string: 1,
1 2,
5 3, 4, 1, 2, 5, 1, 2, 3, 4, 5
2
(Counter implementation)
(entry) page , page , counter
page counter
|

LRU Page Replacement
|

LRU Algorithm (Cont.)

(Stack implementation)
(page numbers) (double
link form):
Page referenced:

6 pointers

stack algorithm Beladys Anomaly

interrupt
|

Use Of A Stack to Record The Most Recent Page References
|

LRU Approximation Algorithms

(Additional-Reference-bits
algorithm)

bit, = 0 ( )
1 ( )

(Second chance)
(reference bit) (Clock replacement)

() = 1 :
|

Second-Chance (clock) Page-Replacement Algorithm
|

Counting Algorithms

LFU (least frequently used) Algorithm:

MFU (most frequently used) Algorithm:

(OPT)
|

Page-Buffering Algorithm

page fault

(clustering)
|

Operating System Examples

Windows NT
Solaris 2
|

Windows NT
demand paging clustering page

working set minimum

working set maximum
Working set minimum
working set maximum
(threshold)
working set (automatic working set
trimming)
Working set trimming
working set minimum
|

Paging System Windows NT
|

Address translation Windows
|

Solaris 2
(free pages)

Lotsfree threshold parameter
(pageout process)
Pageout scans pages using modified clock algorithm.
Scanrate
slowscan fastscan
Pageout
|

Solar Page Scanner
|


7-OS Virtual Memory

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

7-OS Virtual Memory

Uploaded by

Copyright:

Available Formats

Memory Management

Virtual Memory That is Larger Than Physical Memory

(Less I/O needed)

Transfer of a Paged Memory to Contiguous Disk Space

validinvalid bit page table

Page Table When Some Pages Are Not in Main Memory

Invalid reference abort.

Steps in Handling a Page Fault

Page (Page replacement)

Performance of Demand Paging

Effective Access Time (EAT)

Demand Paging Example

Swap Page Time = 10 msec = 10,000 msec

Memory-mapped file I/O file I/O

demand paging page-sized

treating file I/O read() write() system

Memory Mapped Files

Need For Page Replacement

Basic Page Replacement

Page Replacement Algorithms

Graph of Page Faults Versus The Number of Frames

frames page faults 2

FIFO Page Replacement

FIFO Illustrating Beladys Anamoly

Optimal Page Replacement

Least Recently Used (LRU) Algorithm

LRU Page Replacement

LRU Algorithm (Cont.)

stack algorithm Beladys Anomaly

Use Of A Stack to Record The Most Recent Page References

LRU Approximation Algorithms

(reference bit) (Clock replacement)

Second-Chance (clock) Page-Replacement Algorithm

MFU (most frequently used) Algorithm:

Operating System Examples

working set minimum

Paging System Windows NT

Address translation Windows

Solar Page Scanner

You might also like