Virtual memory. Hung-Wei Tseng

Transcription

1 Virtual memory Hung-Wei Tseng

2 Why virtual memory How VM works VM and cache Outline 4

3 Virtual memory 5

4 Scenario I An application is design on machine A with memory size X. Can we safely execute the same application on another machine B with memory size Y? physical memory of machine A Application physical memory of machine B? 6

5 Scenario II Both application A and application B would like to use the same machine Each application should not touch data of the other. This is called protection in OS Application A Physical memory of the machine Application B 7

6 Why Virtual Memory? Every process runs on virtual memory space Process: a running program in the operating system virtual memory memory. Physical memory caches memory pages from Single program can exceed the size of physical Multiple processes can share a single main memory. virtual address space of program A virtual address space of program B 8

7 Memory Hierarchy Fastest, Most Expensive CPU $ Main Memory Secondary Storage Main memory is a cache for Virtual Memory A: Fully Associative B: page size! S: (Since it s FA) Replacement policies? LRU, random... Operating system manages the mapping between physical and virtual VM addresses Biggest 9

8 How VM works

9 Virtual memory An abstraction of memory space available for programs/software/programmer Programs execute using virtual memory address The operating system and hardware work together to handle the mapping between virtual memory addresses and real/physical memory addresses

10 Address translation Processor uses virtual addresses, main memory uses physical memory addresses Virtual address space is organized into pages The system references the page table to translate addresses each process has its own page table the page table content is maintained by OS VA: valid virtual page # offset PA: physical page # offset 2

11 Hierarchical page table Break the virtual page number into several pieces If one piece has N bits, build an 2N -ary tree Only store the part of the tree that contain valid pages valid Walk down the tree to translate the virtual address level index level 2 index offset physical page # offset 4

12 Hierarchical page table valid 5

13 Page fault When the referenced memory page is not mapped to physical memory The processor raises an exception and transfers the control (change the PC) to operating system code that handles the page fault LRU or other page replacement policies to decide the evicting page Fetch the demanding page from secondary storage (hard drive, SSD) Transfer the control back to the original program Could be slow! The access time of hard drive is more than 6ms 6

14 PC Pipeline with exception PCWrite PCSrc m ux IF/IDWrite hazard detection unit IF/ID ID/EX EX/MEM MEM/WB Control m ux ID/EX.MemRead WB ME EX m ux m ux WB ME WB RegWrite 4 Add Shi> le> 2 Add RegWrite Cause EPC MemWrite Read Address Instruc(on Memory inst[3:] inst[5:] inst[25:2] inst[2:6] 6 Read Reg Register Read Reg 2 File Write Reg Write Data signextend 32 Read Data Read Data 2 m ux ForwardA m ux RegDst ForwardB m ux Zero ALU ALUop Address Write Data Data Memory MemRead Read Data MemtoReg m ux ForwardA ForwardB forwarding unit ALUSrc 7

15 VM & Cache 9

16 Cache + Virtual Memory Processor Processor. VA $ PA PA Too slow! main memory 5 ns+ lantency TLB: Translation Look-aside Buffer a cache of page table small, high-associativity miss penalty: access to page table in main memory $. VA TLB 2. PA TLB increase the hit time! main memory 2

17 Cache+Virtual Memory Processor Virtual Cache The cache also uses virtual addresses Address translation is required only when miss.. VA TLB $. VA 2. PA main memory 2

18 Problems of Virtual Cache Multiple processes accessing to the same virtual address Process A accessed x. Process B also want to access x Flush the cache when context switch Attach PID to cache virtual addresses of A x huge overhead in multiprogrammed systems increase hardware costs virtual addresses of B? x cache x 22

19 Problems of Virtual Cache Alias: A physical address maps to different virtual addresses Two copies of data in cache due to copy on write. One may get the wrong data if the other is modified. virtual address x x3 cache x x3 physical address xff also points to xff 23

20 Virtually indexed, physically tagged cache. VA 2. PA TLB Processor = miss $ main memory. VA 2. PA Force aliasing virtual addresses mapped to the same cache location. The cache uses the index field to place data blocks Page offset remains the same in virtual and physical addresses index field must be inside the page offset to guarantee that aliasing are mapped to the same place Cache stores tag fields of physical addresses 24

21 Virtually indexed, physically tagged cache page number page offset tag index offset memory address: # of bits in page offset == # bits in index and offset TLB virtual page # physical page # valid dirty tag Cache array data C = ABS lg(s)+lg(b) = 2 =? if A = (DM cache) C = *(2 2 ) = 4KB Stores the tag of physical addresses, which is also the physical page #! hit? miss? 25

22 Virtually indexed, physically tagged cache Force aliasing virtual addresses mapped to the same cache location. Cache stores tag fields of physical addresses the physical tag is also the physical page number! virtual page # TLB physical page # page offset $ index+block offset physical tag == physical page # C = ABS lg(s)+lg(b) = 2 if A = (DM cache) C = *(2 2 ) = 4KB physical page # offset 29

23 9 bits index, 6 bits offset AMD Phenom II 64KB D-L cache, 64B block, 2-way associative. Windows 7 has 4KB page size Page offset 2 bits How to achieve virtually indexed, physically tagged? Check a total of 8 possible location. Invalid all aliasing blocks and fetch new from low level hierarchy. 3