1. Today
How was the midterm review?
Lab4 due today

2. What is Virtual Memory again?
And what is it for?

3. Virtual Memory reminder
mapping
Process 1
Physical memory
Virtual memory
Process n
What problems does it solve?

4. Main memory as a “cache”
Physical Memory
A virtual address can be mapped to either physical memory or disk.
Think of memory as a “cache” for the whole address space.
Virtual Address
Disk

5. A System Using Physical Addressing
Main memory 0: 1: 2:
Physical address
(PA) 3:
CPU 4: 4 5: 6: 7: 8:
...
M-1:
Data word

6. A System Using Virtual Addressing
Main memory 0:
CPU Chip 1: 2:
Virtual address
(VA)
Physical address
(PA) 3:
CPU
MMU 4: 4
4100 5: 6: 7: 8:
...
M-1:
Data word

7. Indexing into Physical Memory
Main memory 0:
CPU Chip 1: 2:
Virtual address
(VA)
Physical address
(PA) 3:
CPU
MMU 4: 4
4100 5: 6: 7: 8:
...
M-1:
Data word
How do we perform the VA -> PA translation?

8. Address Translation: Page Tables
A page table (PT) is an array of page table entries (PTEs) that maps virtual pages to physical pages.
Physical memory
(DRAM)
Physical page
number or
disk address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory (disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
How many page tables are in the system?
VP 6
VP 7

9. Address Translation: Page Tables
A page table (PT) is an array of page table entries (PTEs) that maps virtual pages to physical pages.
Physical memory
(DRAM)
Physical page
number or
disk address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory (disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
How many page tables are in the system?
One per process
VP 6
VP 7

10. Address Translation With a Page Table
Virtual address (VA)
Page table base register
(PTBR)
Virtual page number (VPN)
Virtual page offset (VPO)
Page table
Page table address
for process
Valid
Physical page number (PPN)
PTBR is another name for control register 3 (CR3) in x86:
Valid bit = 0:
page not in memory
(page fault)
In most cases, the hardware (the MMU) can perform this translation on its own, without software assistance
Physical page number (PPN)
Physical page offset (PPO)
Physical address (PA)

11. Page Hit Page hit: reference to VM byte that is in physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
VP 6
VP 7

12. Page Fault
Page fault: reference to VM byte that is NOT in physical memory
Physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
Valid
VP 1
PP 0
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
What happens when a page fault occurs?
VP 6
VP 7

13. Fault Example: Page Fault
int a[1000];
main () {
a[500] = 13; }
User writes to memory location
That portion (page) of user’s memory is currently on disk
Page handler must load page into physical memory
Returns to faulting instruction: mov is executed again!
Successful on second try
80483b7: c d d movl $0xd,0x8049d10
User Process OS
exception: page fault
movl
Create page and
load into memory
returns

14. Handling Page Fault Page miss causes page fault (an exception)
Physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
VP 6
VP 7

15. Handling Page Fault Page miss causes page fault (an exception)
Page fault handler selects a victim to be evicted (here VP 4)
Physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 4
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
VP 6
VP 7

16. Handling Page Fault Page miss causes page fault (an exception)
Page fault handler selects a victim to be evicted (here VP 4)
Physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 3
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
VP 6
VP 7

17. Handling Page Fault Page miss causes page fault (an exception)
Page fault handler selects a victim to be evicted (here VP 4)
Offending instruction is restarted: page hit!
Physical memory
(DRAM)
Physical page
number or
disk address
Virtual address
VP 1
PP 0
Valid
VP 2
PTE 0
null
VP 7 1
VP 3
PP 3 1 1
Virtual memory
(disk)
null
PTE 7 1
VP 1
Memory resident
page table
(DRAM)
VP 2
VP 3
VP 4
VP 6
VP 7

18. Why does it work?

19. Why does it work? Locality
Virtual memory works well because of locality
Same reason that L1 / L2 / L3 caches work
The set of virtual pages that a program is “actively” accessing at any point in time is called its working set
Programs with better temporal locality will have smaller working sets
If (working set size < main memory size):
Good performance for one process after compulsory misses
if (SUM(working set sizes) > main memory size)?

20. Why does it work? Locality
Virtual memory works well because of locality
Same reason that L1 / L2 / L3 caches work
The set of virtual pages that a program is “actively” accessing at any point in time is called its working set
Programs with better temporal locality will have smaller working sets
If (working set size < main memory size):
Good performance for one process after compulsory misses
If (SUM(working set sizes) > main memory size):
Thrashing: Performance meltdown where pages are swapped (copied) in and out continuously

21. VM for Managing Multiple Processes
Key abstraction: each process has its own virtual address space
It can view memory as a simple linear array
With virtual memory, this simple linear virtual address space need not be contiguous in physical memory
Process needs to store data in another VP? Just map it to any PP!
Address
translation
Virtual Address Space for Process 1:
Physical
Address
Space (DRAM)
VP 1
VP 2
PP 2
...
N-1
(e.g., read-only
library code)
PP 6
Virtual Address Space for Process 2:
PP 8
VP 1
VP 2
...
...
N-1
M-1

22. VM for Protection and Sharing
The mapping of VPs to PPs provides a simple mechanism for protecting memory and for sharing memory btw. processes
Sharing: just map virtual pages in separate address spaces to the same physical page (here: PP 6)
Protection: process simply can’t access physical pages it doesn’t have a mapping for (here: Process 2 can’t access PP 2)
Address
translation
Virtual Address Space for Process 1:
Physical
Address
Space (DRAM)
VP 1
VP 2
PP 2
...
N-1
(e.g., read-only
library code)
PP 6
Virtual Address Space for Process 2:
PP 8
VP 1
VP 2
...
...
N-1
M-1

23. Memory Protection Within a Single Process
Can we use virtual memory to control read/write/execute permissions? How?

24. Memory Protection Within a Single Process
Extend PTEs with permission bits
MMU checks these permission bits on every memory access
If violated, raises exception and OS sends SIGSEGV signal to process
Physical
Address Space
Process i:
Valid
SUP
WRITE
EXEC
Address
VP 0:
VP 1:
VP 2:
Yes
Yes No No
PP 6 No No
Yes
PP 4
PP 2
Yes
Yes No
PP 2 •
PP 4
PP 6
Process j:
Valid
SUP
WRITE
EXEC
Address
PP 8 No
Yes No
PP 9
PP 9
Yes No No
PP 6 No
Yes No
PP 11
PP 11

25. Address Translation: Page Hit2
CPU Chip
Cache/
Memory
PTEA
MMU 1
PTE
CPU VA 3 PA 4
Data 5
1) Processor sends virtual address to MMU (memory management unit)
2-3) MMU fetches PTE from page table in cache/memory
4) MMU sends physical address to cache/memory
5) Cache/memory sends data word to processor

26. Address Translation: Page Fault
Exception
Page fault handler 4 2
CPU Chip
Cache/
Memory
Disk
PTEA
Victim page
MMU 1 5
CPU VA
PTE 7 3
New page 6
1) Processor sends virtual address to MMU
2-3) MMU fetches PTE from page table in cache/memory
4) Valid bit is zero, so MMU triggers page fault exception
5) Handler identifies victim (and, if dirty, pages it out to disk)
6) Handler pages in new page and updates PTE in memory
7) Handler returns to original process, restarting faulting instruction

27. Hmm… Translation Sounds Slow!
The MMU accesses memory twice: once to first get the PTE for translation, and then again for the actual memory request from the CPU
The PTEs may be cached in L1 like any other memory word
But they may be evicted by other data references
And a hit in the L1 cache still requires 1-3 cycles
What can we do to make this faster?

28. Speeding up Translation with a TLB
Solution: add another cache!
Translation Lookaside Buffer (TLB):
Small hardware cache in MMU
Maps virtual page numbers to physical page numbers
Contains complete page table entries for small number of pages
Modern Intel processors: 128 or 256 entries in TLB
“x86info -c” on Intel Core2 Duo CPU:
L1 Data TLB: 4KB pages, 4-way set associative, 16 entries
Data TLB: 4K pages, 4-way associative, 256 entries.
L1 Data TLB: 4MB pages, 4-way set associative, 16 entries
Data TLB: 4MB pages, 4-way associative, 32 entries

29. TLB Hit A TLB hit eliminates a memory access CPU Chip TLB Cache/ MMU2
PTE
VPN 3
Cache/
Memory
MMU 1
CPU VA PA 4
Data 5
A TLB hit eliminates a memory access

30. TLB Miss
CPU Chip
TLB 4 2
PTE
VPN
Cache/
Memory
MMU 1 3
CPU VA
PTEA PA 5
Data 6
A TLB miss incurs an additional memory access (the PTE) Fortunately, TLB misses are rare

31. Simple Memory System Example
Addressing
14-bit virtual addresses
12-bit physical address
Page size = 64 bytes 13 12 11 10 9 8 7 6 5 4 3 2 1
VPN
VPO
Virtual Page Number
Virtual Page Offset 11 10 9 8 7 6 5 4 3 2 1
PPN
PPO
Physical Page Number
Physical Page Offset

32. Simple Memory System Page Table
Only showing first 16 entries (out of 256)
VPN
PPN
Valid
VPN
PPN
Valid 00 28 1 08 13 1 01 – 09 17 1 02 33 1 0A 09 1 03 02 1 0B – 04 – 0C – 05 16 1 0D 2D 1 06 – 0E 11 1 07 – 0F 0D 1

33. Simple Memory System TLB
16 entries
4-way associative
TLBT
TLBI 13 12 11 10 9 8 7 6 5 4 3 2 1
VPN
VPO
Set
Tag
PPN
Valid
Tag
PPN
Valid
Tag
PPN
Valid
Tag
PPN
Valid 03 – 09 0D 1 00 – 07 02 1 1 03 2D 1 02 – 04 – 0A – 2 02 – 08 – 06 – 03 – 3 07 – 03 0D 1 0A 34 1 02 –

34. Simple Memory System Cache
16 lines, 4-byte block size
Physically addressed
Direct mapped CT CI CO 11 10 9 8 7 6 5 4 3 2 1
PPN
PPO
Idx
Tag
Valid B0 B1 B2 B3
Idx
Tag
Valid B0 B1 B2 B3 19 1 99 11 23 11 8 24 1 3A 00 51 89 1 15 – – – – 9 2D – – – – 2 1B 1 00 02 04 08 A 2D 1 93 15 DA 3B 3 36 – – – – B 0B – – – – 4 32 1 43 6D 8F 09 C 12 – – – – 5 0D 1 36 72 F0 1D D 16 1 04 96 34 15 6 31 – – – – E 13 1 83 77 1B D3 7 16 1 11 C2 DF 03 F 14 – – – –

35. Current state of caches/tables
page size = 64 bytes
TLB 1 0D 0F 11 0E 2D – 0C 0B 09 0A 17 13 08
Valid
PPN
VPN 07 06 16 05 04 02 03 33 01 28 00 – 02 1 34 0A 0D 03 07 3 06 08 2 04 2D 00 09
Valid
PPN
Tag
Set
Page table
Cache 03 DF C2 11 1 16 7 – 31 6 1D F0 72 36 0D 5 09 8F 6D 43 32 4 3 08 04 02 00 1B 2 15 23 99 19 B3 B2 B1 B0
Valid
Tag
Idx 14 F D3 77 83 13 E 34 96 D 12 C 0B B 3B DA 93 2D A 9 89 51 3A 24 8

36. Address Translation Example #1
Virtual Address: 0x03D4
VPN ___ TLBI ___ TLBT ____ TLB Hit? __ Page Fault? __ PPN: ____
Physical Address
CO ___ CI___ CT ____ Hit? __ Byte: ____
TLBT
TLBI 13 12 11 10 9 8 7 6 5 4 3 2 1 1 1 1 1 1 1
VPN
VPO
0x0F 3
0x03 Y N
0x0D CT CI CO 11 10 9 8 7 6 5 4 3 2 1 1
PPN
PPO
0x5
0x0D Y
0x36

37. Address Translation Example #2
Virtual Address: 0x0B8F
VPN ___ TLBI ___ TLBT ____ TLB Hit? __ Page Fault? __ PPN: ____
Physical Address
CO ___ CI___ CT ____ Hit? __ Byte: ____
TLBT
TLBI 13 12 11 10 9 8 7 6 5 4 3 2 1 1 1 1 1 1 1 1 1
VPN
VPO
0x2E
A TLB miss does not always mean a page fault. 2
0x0B N ?
TBD CT CI CO 11 10 9 8 7 6 5 4 3 2 1
PPN
PPO

38. Address Translation Example #3
Virtual Address: 0x0020
VPN ___ TLBI ___ TLBT ____ TLB Hit? __ Page Fault? __ PPN: ____
Physical Address
CO___ CI___ CT ____ Hit? __ Byte: ____
TLBT
TLBI 13 12 11 10 9 8 7 6 5 4 3 2 1 1
VPN
VPO
0x00
0x00 N N
0x28 CT CI CO 11 10 9 8 7 6 5 4 3 2 1 1
PPN
PPO
0x8
0x28 N
Mem

39. Summary Programmer’s view of virtual memory
Each process has its own private linear address space
Cannot be corrupted by other processes
System view of virtual memory
Uses memory efficiently by caching virtual memory pages
Efficient only because of locality
Simplifies memory management and sharing
Simplifies protection by providing a convenient interpositioning point to check permissions

40. Memory System Summary L1/L2 Memory Cache Virtual Memory
Purely a speed-up technique
Behavior invisible to application programmer and (mostly) OS
Implemented totally in hardware
Virtual Memory
Supports many OS-related functions
Process creation, task switching, protection
Software
Allocates/shares physical memory among processes
Maintains high-level tables tracking memory type, source, sharing
Handles exceptions, fills in hardware-defined mapping tables
Hardware
Translates virtual addresses via mapping tables, enforcing permissions
Accelerates mapping via translation cache (TLB)

42. (2) Direct Memory Address Transfer
Servicing a Page Fault
(1) Processor signals disk controller
Read block of length P starting at disk address X
Store starting at memory address Y
(2) Read occurs
Direct Memory Access (DMA)
Under control of I/O controller
(3) Controller signals completion
Interrupts processor
OS resumes suspended process
(1) Initiate Block Read
Processor
Reg
(3) Read Done
Cache
Memory-I/O bus
I/O
controller
Memory
(2) Direct Memory Address Transfer
Disk
Disk