Ch09

Chapter 9: Virtual Memory ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Background ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Virtual Memory That is Larger Than Physical Memory 

Shared Library Using Virtual Memory

Demand Paging ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Transfer of a Paged Memory to Contiguous Disk Space

Valid-Invalid Bit ,[object Object],[object Object],[object Object],[object Object],1 1 1 1 0 0 0  Frame # valid-invalid bit page table

Page Table When Some Pages Are Not in Main Memory

Page Fault ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Steps in Handling a Page Fault

What happens if there is no free frame? ,[object Object],[object Object],[object Object],[object Object]

Performance of Demand Paging ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Demand Paging Example ,[object Object],[object Object],[object Object],[object Object],[object Object]

Process Creation ,[object Object],[object Object],[object Object]

Copy-on-Write ,[object Object],[object Object],[object Object]

Page Replacement ,[object Object],[object Object],[object Object]

Basic Page Replacement ,[object Object],[object Object],[object Object],[object Object]

Page Replacement Algorithms ,[object Object],[object Object],[object Object],[object Object]

Graph of Page Faults Versus The Number of Frames

First-In-First-Out (FIFO) Algorithm ,[object Object],[object Object],[object Object],[object Object],[object Object],1 2 3 1 2 3 4 1 2 5 3 4 9 page faults 1 2 3 1 2 3 5 1 2 4 5 10 page faults 4 4 3

FIFO Illustrating Belady’s Anomaly

Optimal Algorithm ,[object Object],[object Object],[object Object],[object Object],[object Object],1 2 3 4 6 page faults 4 5

Least Recently Used (LRU) Algorithm ,[object Object],[object Object],[object Object],[object Object],1 2 3 5 4 4 3 5

LRU Algorithm (Cont.) ,[object Object],[object Object],[object Object],[object Object],[object Object]

Use Of A Stack to Record The Most Recent Page References

LRU Approximation Algorithms ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Second-Chance (clock) Page-Replacement Algorithm

Counting Algorithms ,[object Object],[object Object],[object Object]

Allocation of Frames ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Fixed Allocation ,[object Object],[object Object]

Priority Allocation ,[object Object],[object Object],[object Object],[object Object]

Global vs. Local Allocation ,[object Object],[object Object]

Thrashing ,[object Object],[object Object],[object Object],[object Object],[object Object]

Demand Paging and Thrashing ,[object Object],[object Object],[object Object],[object Object]

Locality In A Memory-Reference Pattern

Working-Set Model ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Keeping Track of the Working Set ,[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object],[object Object]

Page-Fault Frequency Scheme ,[object Object],[object Object],[object Object]

Ch09

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (18)

En vedette

En vedette (16)

Similaire à Ch09

Similaire à Ch09 (20)

Dernier

Dernier (20)

Ch09