virtual memory systems
Download
Skip this Video
Download Presentation
Virtual Memory: Systems

Loading in 2 Seconds...

play fullscreen
1 / 32

Virtual Memory: Systems - PowerPoint PPT Presentation


  • 204 Views
  • Uploaded on

Virtual Memory: Systems. Virtual Memory: Systems . Virtual memory questions and answers Simple memory system example Case study: Core i7/Linux memory system. Virtual memory reminder/review. Programmer’s view of virtual m emory Each process has its own private linear address space

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Virtual Memory: Systems' - tamara-simmons


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
virtual memory systems1
Virtual Memory: Systems
  • Virtual memory questions and answers
  • Simple memory system example
  • Case study: Core i7/Linux memory system
virtual memory reminder review
Virtual memory reminder/review
  • 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 programming
    • Simplifies protection by providing a convenient interpositioning point to check permissions
recall address translation with a page table
Recall: Address Translation With a Page Table

Virtual address

n-1

p

p-1

0

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

Valid bit = 0:

page not in memory

(page fault)

m-1

p

p-1

0

  • Physical page number (PPN)

Physical page offset (PPO)

Physical address

recall address translation page hit
Recall: Address Translation: Page Hit

1) Processor sends virtual address to MMU

2-3) MMU fetches PTE from page table in memory

4) MMU sends physical address to cache/memory

5) Cache/memory sends data word to processor

2

Cache/

Memory

CPU Chip

PTEA

MMU

1

PTE

VA

CPU

3

PA

4

Data

5

question 1
Question #1
  • Are the PTEs cached like other memory accesses?
  • Yes (and no: see next question)
page tables in memory like other data
Page tables in memory, like other data

PTE

CPU Chip

PTE

PTEA

hit

MMU

Memory

PTEA

PTEA

miss

PTEA

CPU

VA

PA

PA

PA

miss

Data

PA

hit

L1

cache

Data

VA: virtual address, PA: physical address, PTE: page table entry, PTEA = PTE address

question 2
Question #2
  • Isn’t it slow to have to go to memory twice every time?
  • Yes, it would be… so, real MMUs don’t
speeding up translation with a tlb
Speeding up Translation with a TLB
  • Page table entries (PTEs) are cached in L1 like any other memory word
    • PTEs may be evicted by other data references
    • PTE hit still requires a small L1 delay
  • Solution: Translation Lookaside Buffer (TLB)
    • Small, dedicated, super-fast hardware cache of PTEsin MMU
    • Contains complete page table entries for small number of pages
tlb hit
TLB Hit

CPU Chip

TLB

PTE

2

3

VPN

Cache/

Memory

MMU

1

PA

VA

CPU

4

Data

5

A TLB hit eliminates a memory access

tlb miss
TLB Miss

CPU Chip

TLB

4

PTE

2

VPN

Cache/

Memory

MMU

1

3

VA

CPU

PTEA

PA

5

Data

6

A TLB miss incurs an additional memory access (the PTE)Fortunately, TLB misses are rare. Why?

question 3
Question #3
  • Isn’t the page table huge? How can it be stored in RAM?
  • Yes, it would be… so, real page tables aren’t simple arrays
multi level page tables
Multi-Level Page Tables

Level 2

Tables

  • Suppose:
    • 4KB (212) page size, 64-bit address space, 8-byte PTE
  • Problem:
    • Would need a 32,000 TB page table!
      • 264 * 2-12 * 23 = 255 bytes
  • Common solution:
    • Multi-level page tables
    • Example: 2-level page table
      • Level 1 table: each PTE points to a page table (always memory resident)
      • Level 2 table: each PTE points to a page (paged in and out like any other data)

Level 1

Table

...

...

a two level page table hierarchy
A Two-Level Page Table Hierarchy

Level 1

page table

Virtual

memory

Level 2

page tables

0

VP 0

...

PTE 0

PTE 0

VP 1023

2K allocated VM pages

for code and data

...

PTE 1

VP 1024

PTE 1023

PTE 2 (null)

...

PTE 3 (null)

VP 2047

PTE 4 (null)

PTE 0

Gap

PTE 5 (null)

...

PTE 6 (null)

PTE 1023

6K unallocated VM pages

PTE 7 (null)

PTE 8

1023 null

PTEs

(1K - 9)

null PTEs

PTE 1023

1023

unallocated

pages

1023 unallocated pages

1 allocated VM page

for the stack

VP 9215

32 bit addresses, 4KB pages, 4-byte PTEs

...

translating with a k level page table
Translating with a k-level Page Table

VIRTUAL ADDRESS

n-1

p-1

0

VPN 1

VPN 2

...

VPN k

VPO

Level k

page table

Level 2

page table

Level 1

page table

...

...

PPN

m-1

p-1

0

PPN

PPO

PHYSICAL ADDRESS

virtual memory systems2
Virtual Memory: Systems
  • Virtual memory questions and answers
  • Simple memory system example
  • Case study: Core i7/Linux memory system
review of symbols
Review of Symbols
  • Basic Parameters
    • N = 2n : Number of addresses in virtual address space
    • M = 2m : Number of addresses in physical address space
    • P = 2p : Page size (bytes)
  • Components of the virtual address (VA)
    • VPO: Virtual page offset
    • VPN: Virtual page number
    • TLBI: TLB index
    • TLBT: TLB tag
  • Components of the physical address (PA)
    • PPO: Physical page offset (same as VPO)
    • PPN: Physical page number
    • CO: Byte offset within cache line
    • CI: Cache index
    • CT: Cache tag
simple memory system example

VPN

VPO

PPN

PPO

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

0

Virtual Page Offset

Virtual Page Number

11

10

9

8

7

6

5

4

3

2

1

0

Physical Page Number

Physical Page Offset

simple memory system page table
Simple Memory System Page Table

Only show first 16 entries (out of 256)

VPN

PPN

Valid

VPN

PPN

Valid

00

28

1

08

13

1

01

0

09

17

1

02

33

1

0A

09

1

03

02

1

0B

0

04

0

0C

0

05

16

1

0D

2D

1

06

0

0E

11

1

07

0

0F

0D

1

simple memory system tlb

TLBT

TLBI

VPN

VPO

Simple Memory System TLB
  • 16 entries
  • 4-way associative

13

12

11

10

9

8

7

6

5

4

3

2

1

0

Set

Tag

PPN

Valid

Tag

PPN

Valid

Tag

PPN

Valid

Tag

PPN

Valid

0

03

0

09

0D

1

00

0

07

02

1

1

03

2D

1

02

0

04

0

0A

0

2

02

0

08

0

06

0

03

0

3

07

0

03

0D

1

0A

34

1

02

0

simple memory system cache

CI

CT

CO

PPN

PPO

Simple Memory System Cache
  • 16 lines, 4-byte block size
  • Physically addressed
  • Direct mapped

11

10

9

8

7

6

5

4

3

2

1

0

Idx

Tag

Valid

B0

B1

B2

B3

Idx

Tag

Valid

B0

B1

B2

B3

0

19

1

99

11

23

11

8

24

1

3A

00

51

89

1

15

0

9

2D

0

2

1B

1

00

02

04

08

A

2D

1

93

15

DA

3B

3

36

0

B

0B

0

4

32

1

43

6D

8F

09

C

12

0

5

0D

1

36

72

F0

1D

D

16

1

04

96

34

15

6

31

0

E

13

1

83

77

1B

D3

7

16

1

11

C2

DF

03

F

14

0

address translation example 1

VPN

VPO

CI

CT

CO

0

0

1

1

0

1

0

1

0

1

0

0

PPN

PPO

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

0

0

1

0

1

0

0

0

0

0

1

1

1

1

0

Y

0x0F

0x3

0x03

N

0x0D

11

10

9

8

7

6

5

4

3

2

1

0

0

0x5

0x0D

Y

0x36

address translation example 2

VPN

VPO

CI

CT

CO

PPN

PPO

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

0

0

0

1

1

1

0

0

1

0

1

1

1

0

1

N

0x2E

2

0x0B

Y

TBD

11

10

9

8

7

6

5

4

3

2

1

0

address translation example 3

VPN

VPO

CI

CT

CO

1

0

1

0

0

0

1

0

0

0

0

0

PPN

PPO

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

0

1

0

0

0

0

0

0

0

0

0

0

0

0

0

N

0x00

0

0x00

N

0x28

11

10

9

8

7

6

5

4

3

2

1

0

0

0x8

0x28

N

Mem

virtual memory systems3
Virtual Memory: Systems
  • Virtual memory questions and answers
  • Simple memory system example
  • Case study: Core i7/Linux memory system
intel core i7 memory system
Intel Core i7 Memory System

Processor package

Core x4

Registers

Instruction

fetch

MMU

(addr translation)

L1 d-cache

32 KB, 8-way

L1 d-TLB

64 entries, 4-way

L1 i-TLB

128 entries, 4-way

L1 i-cache

32 KB, 8-way

L2 unified cache

256 KB, 8-way

L2 unified TLB

512 entries, 4-way

To other

cores

QuickPath interconnect

4 links @ 25.6 GB/s each

To I/O

bridge

L3 unified cache

8 MB, 16-way

(shared by all cores)

DDR3 Memory controller

3 x 64 bit @ 10.66 GB/s

32 GB/s total (shared by all cores)

Main memory

review of symbols1
Review of Symbols
  • Basic Parameters
    • N = 2n : Number of addresses in virtual address space
    • M = 2m : Number of addresses in physical address space
    • P = 2p : Page size (bytes)
  • Components of the virtual address (VA)
    • TLBI: TLB index
    • TLBT: TLB tag
    • VPO: Virtual page offset
    • VPN: Virtual page number
  • Components of the physical address (PA)
    • PPO: Physical page offset (same as VPO)
    • PPN: Physical page number
    • CO: Byte offset within cache line
    • CI: Cache index
    • CT: Cache tag
end to end core i7 address translation
End-to-end Core i7 Address Translation

CPU

32/64

L2, L3, and

main memory

Result

Virtual address (VA)

36

12

VPN

VPO

L1

miss

L1

hit

32

4

TLBT

TLBI

L1 d-cache

(64 sets, 8 lines/set)

TLB

hit

TLB

miss

...

...

L1 TLB (16 sets, 4 entries/set)

9

9

9

9

40

12

40

6

6

VPN1

VPN2

VPN3

VPN4

CT

CI

CO

PPN

PPO

Physical

address

(PA)

CR3

PTE

PTE

PTE

PTE

Page tables

core i7 page table translation
Core i7 Page Table Translation

9

9

9

9

12

Virtual

address

VPN 1

VPN 2

VPN 3

VPN 4

VPO

L1 PT

Page global

directory

L2 PT

Page upper

directory

L3 PT

Page middle

directory

L4 PT

Page

table

40

40

40

40

/

/

CR3

/

/

Physical

address

of L1 PT

Offset into

physical and

virtual page

/

12

L4 PTE

L1 PTE

L2 PTE

L3 PTE

Physical

address

of page

512 GB

region

per entry

1 GB

region

per entry

2 MB

region

per entry

4 KB

region

per entry

40

/

40

12

Physical

address

PPN

PPO

cute trick for speeding up l1 access
Cute Trick for Speeding Up L1 Access

CT

Tag Check

  • Observation
    • Bits that determine CI identical in virtual and physical address
    • Can index into cache while address translation taking place
    • Generally we hit in TLB, so PPN bits (CT bits) available next
    • “Virtually indexed, physically tagged”
    • Cache carefully sized to make this possible

36

6

6

Physical

address

(PA)

CT

CI

CO

PPN

PPO

No

Change

Address

Translation

Virtual

address

(VA)

CI

L1 Cache

VPN

VPO

36

12

summary
Summary
  • Memory hierarchies are an optimization resulting from a perfect match between memory technology and two types of program locality
    • Temporal locality
    • Spatial locality
  • The goal is to provide a “virtual” memory technology (an illusion) that has an access time of the highest-level memory with the size and cost of the lowest-level memory
  • Cache memory and virtual memory are instances of a memory hierarchy
a common framework for memory hierarchies
A Common Framework for Memory Hierarchies
  • Question 1: Where can a Block be Placed? One place (direct-mapped), a few places (set associative), or any place (fully associative)
  • Question 2: How is a Block Found? Indexing (direct-mapped), limited search (set associative), full search (fully associative)
  • Question 3: Which Block is Replaced on a Miss? Typically LRU or random
  • Question 4: How are Writes Handled? Write-through or write-back
ad