Memory Management
Memory Hierarchy
Page Replacement Algorithms
Optimal Page Replacement Algorithm (PRA)
Not Recently Used PRA
Not Recently Used PRA (II)
Not Recently Used PRA (III)
First-In, First-Out PRA
Second-Chance Page Replacement Algorithm
Least Recently Used (LRU) PRA
Design issues for Paging Systems
Design issues for Paging Systems (II)
Design issues for Paging Systems (III)
Local Vs. Global Allocation Policies
Local Vs Global Allocation Policies (II)
Page Size
Virtual Memory Interface
Segmentation
Segmentation (II)
Segmentation (III)
Implementation of Pure Segmentation
Segmentation with Paging: Pentium
Tables
Pentium Selector
Pentium Selector (II)
Protection
Conversion
Linear to Physical Address
Overview of Memory Management in MINIX
Memory Management in MINIX (II)
Memory Management in MINIX (III)
Memory Management in MINIX (IV)
Unusual Aspect
Unusual Aspect (II)
Memory Layout
Memory Layout (II)
Memory Allocation
Memory Allocation (II)
Disk vs. Memory
Message Handling
Steps Required for Fork
Steps Required for Fork (II)
Steps Required for Fork (III)
Process Termination
Steps Required for EXEC
Steps Required for EXEC (II)
EXEC
EXEC (II)
Enough Memory?
Start-off Routine
Signal Handling
Signal Handling (II)
Signal Handling (III)
Summary
Summary (II)
Summary (III)
Email: burt@umbc
Home Page: www.cs.umbc.edu/~burt