1 / 48

Introduction to Computer Systems 15-213/18-243, spring 2009 18 th Lecture, Mar. 24 th

Introduction to Computer Systems 15-213/18-243, spring 2009 18 th Lecture, Mar. 24 th. Instructors: Gregory Kesden and Markus Püschel. Last Time: Address Translation. Virtual address. Page table base register (PTBR). Virtual page number (VPN). Virtual page offset (VPO). Page table .

wendi
Download Presentation

Introduction to Computer Systems 15-213/18-243, spring 2009 18 th Lecture, Mar. 24 th

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Introduction to Computer Systems15-213/18-243, spring 200918th Lecture, Mar. 24th Instructors: Gregory Kesden and Markus Püschel

  2. Last Time: Address Translation Virtual address • 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) • Physical page number (PPN) Physical page offset (PPO) Physical address

  3. Last Time: Page Fault Exception Page fault handler 4 2 Cache/ Memory Disk CPU Chip Victim page PTEA MMU 1 5 CPU VA PTE 3 7 New page 6

  4. 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

  5. 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 add’l memory access (the PTE)Fortunately, TLB misses are rare

  6. Today • Virtual memory (VM) • Multi-level page tables • Linux VM system • Case study: VM system on P6 • Performance optimization for VM system

  7. Multi-Level Page Tables Level 2 Tables • Given: • 4KB (212) page size • 48-bit address space • 4-byte PTE • Problem: • Would need a 256 GB page table! • 248 * 2-12 * 22 = 238 bytes • Common solution • Multi-level page tables • Example: 2-level page table • Level 1 table: each PTE points to a page table • Level 2 table: each PTE points to a page (paged in and out like other data) • Level 1 table stays in memory • Level 2 tables paged in and out Level 1 Table ... ...

  8. 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 ...

  9. 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

  10. Today • Virtual memory (VM) • Multi-level page tables • Linux VM system • Case study: VM system on P6 • Performance optimization for VM system

  11. Linux Organizes VM as Collection of “Areas” process virtual memory vm_area_struct • pgd: • Page directory address • vm_prot: • Read/write permissions for this area • vm_flags • Shared with other processes or private to this process task_struct mm_struct vm_end vm_start mm pgd vm_prot vm_flags mmap shared libraries vm_next 0x40000000 vm_end vm_start data vm_prot vm_flags 0x0804a020 text vm_next vm_end vm_start 0x08048000 vm_prot vm_flags 0 vm_next

  12. Linux Page Fault Handling process virtual memory vm_area_struct • Is the VA legal? • = Is it in an area defined by a vm_area_struct? • If not (#1), then signal segmentation violation • Is the operation legal? • i.e., Can the process read/write this area? • If not (#2), then signal protection violation • Otherwise • Valid address (#3): handle fault vm_end vm_start vm_prot vm_flags shared libraries vm_next 1 read vm_end 3 vm_start data read vm_prot vm_flags 2 text vm_next write vm_end vm_start vm_prot vm_flags vm_next

  13. Memory Mapping • Creation of new VM area done via “memory mapping” • Create new vm_area_struct and page tables for area • Area can be backed by (i.e., get its initial values from) : • Regular file on disk (e.g., an executable object file) • Initial page bytes come from a section of a file • Nothing (e.g., .bss) • First fault will allocate a physical page full of 0's (demand-zero) • Once the page is written to (dirtied), it is like any other page • Dirty pages are swapped back and forth between a special swap file. • Key point: no virtual pages are copied into physical memory until they are referenced! • Known as “demand paging” • Crucial for time and space efficiency

  14. User-Level Memory Mapping void *mmap(void *start, intlen, intprot, int flags, intfd, int offset) lenbytes start (or address chosen by kernel) lenbytes offset (bytes) Disk file specified by file descriptor fd Process virtual memory

  15. User-Level Memory Mapping void *mmap(void *start, intlen, intprot, int flags, intfd, int offset) • Map len bytes starting at offset offsetof the file specified by file description fd, preferably at address start • start: may be 0 for “pick an address” • prot: PROT_READ, PROT_WRITE, ... • flags: MAP_PRIVATE, MAP_SHARED, ... • Return a pointer to start of mapped area (may not be start) • Example: fast file-copy • Useful for applications like Web servers that need to quickly copy files. • mmap()allows file transfers without copying into user space.

  16. mmap() Example: Fast File Copy int main() { struct stat stat; inti, fd, size; char *bufp; /* open the file & get its size*/ fd = open("./input.txt", O_RDONLY); fstat(fd, &stat); size = stat.st_size; /* map the file to a new VM area */ bufp = mmap(0, size, PROT_READ, MAP_PRIVATE, fd, 0); /* write the VM area to stdout*/ write(1, bufp, size); exit(0); } #include <unistd.h> #include <sys/mman.h> #include <sys/types.h> #include <sys/stat.h> #include <fcntl.h> /* * a program that uses mmapto copy *the file input.txt to stdout */

  17. Exec() Revisited process-specific data structures (page tables, task and mm structs) To run a new program p in the current process using exec(): • Free vm_area_struct’s and page tables for old areas • Create new vm_area_struct’s and page tables for new areas • Stack, BSS, data, text, shared libs. • Text and data backed by ELF executable object file • BSS and stack initialized to zero • Set PC to entry point in .text • Linux will fault in code, data pages as needed physical memory same for each process kernel code/data/stack kernel VM 0xc0… demand-zero stack %esp process VM .data Memory mapped region for shared libraries .text libc.so brk runtime heap (via malloc) uninitialized data (.bss) demand-zero initialized data (.data) .data program text (.text) .text p forbidden 0

  18. Fork() Revisited • To create a new process using fork(): • Make copies of the old process’s mm_struct, vm_area_struct’s, and page tables. • At this point the two processes share all of their pages. • How to get separate spaces without copying all the virtual pages from one space to another? • “Copy on Write” (COW) technique. • Copy-on-write • Mark PTE's of writeable areas as read-only • Writes by either process to these pages will cause page faults • Flag vm_area_struct’s for these areas as private “copy-on-write” • Fault handler recognizes copy-on-write, makes a copy of the page, and restores write permissions. • Net result: • Copies are deferred until absolutely necessary (i.e., when one of the processes tries to modify a shared page).

  19. Memory System Summary • L1/L2 Memory Cache • 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)

  20. Further Reading • Intel TLBs: • Application Note: “TLBs, Paging-Structure Caches, and Their Invalidation”, April 2007

  21. Today • Virtual memory (VM) • Multi-level page tables • Linux VM system • Case study: VM system on P6 • Performance optimization for VM system

  22. Intel P6 (Bob Colwell’s Chip, CMU Alumni) • Internal designation for successor to Pentium • Which had internal designation P5 • Fundamentally different from Pentium • Out-of-order, superscalar operation • Resulting processors • Pentium Pro (1996) • Pentium II (1997) • L2 cache on same chip • Pentium III (1999) • The freshwater fish machines • Saltwater fish machines: Pentium 4 • Different operation, but similar memory system • Abandoned by Intel in 2005 for P6-based Core 2 Duo

  23. P6 Memory System 32 bit address space 4 KB page size L1, L2, and TLBs • 4-way set associative Inst TLB • 32 entries • 8 sets Data TLB • 64 entries • 16 sets L1 i-cache and d-cache • 16 KB • 32 B line size • 128 sets L2 cache • unified • 128 KB–2 MB DRAM external system bus (e.g. PCI) L2 cache cache bus bus interface unit inst TLB data TLB instruction fetch unit L1 i-cache L1 d-cache processor package

  24. Review of Abbreviations • 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

  25. Overview of P6 Address Translation 32 L2 and DRAM CPU result 20 12 virtual address (VA) VPN VPO L1 miss L1 hit 16 4 TLBT TLBI L1 (128 sets, 4 lines/set) TLB hit TLB miss ... ... TLB (16 sets, 4 entries/set) 10 10 VPN1 VPN2 20 7 5 20 12 CT CI CO PPN PPO physical address (PA) PDE PTE Page tables PDBR

  26. P6 2-level Page Table Structure • Page directory • 1024 4-byte page directory entries (PDEs) that point to page tables • One page directory per process • Page directory must be in memory when its process is running • Always pointed to by PDBR • Large page support: • Make PD the page table • Fixes page size to 4MB (why?) • Page tables: • 1024 4-byte page table entries (PTEs) that point to pages • Size: exactly one page • Page tables can be paged in and out Up to 1024 page tables 1024 PTEs page directory ... 1024 PDEs 1024 PTEs ... 1024 PTEs

  27. P6 Page Directory Entry (PDE) 31 12 11 9 8 7 6 5 4 3 2 1 0 Page table physical base address Avail G PS A CD WT U/S R/W P=1 Page table physical base address: 20 most significant bits of physical page table address (forces page tables to be 4KB aligned) Avail: These bits available for system programmers G: global page (don’t evict from TLB on task switch) PS: page size 4K (0) or 4M (1) A: accessed (set by MMU on reads and writes, cleared by software) CD: cache disabled (1) or enabled (0) WT: write-through or write-back cache policy for this page table U/S: user or supervisor mode access R/W: read-only or read-write access P: page table is present in memory (1) or not (0) 31 1 0 Available for OS (page table location in secondary storage) P=0

  28. P6 Page Table Entry (PTE) 31 12 11 9 8 7 6 5 4 3 2 1 0 Page physical base address Avail G 0 D A CD WT U/S R/W P=1 Page base address: 20 most significant bits of physical page address (forces pages to be 4 KB aligned) Avail: available for system programmers G: global page (don’t evict from TLB on task switch) D: dirty (set by MMU on writes) A: accessed (set by MMU on reads and writes) CD: cache disabled or enabled WT: write-through or write-back cache policy for this page U/S: user/supervisor R/W: read/write P: page is present in physical memory (1) or not (0) 31 1 0 Available for OS (page location in secondary storage) P=0

  29. Representation of VM Address Space P=1, M=1 • P=0, M=0 • P=1, M=1 • P=0, M=1 • P=1, M=1 • P=0, M=0 • P=1, M=1 • P=0, M=1 • P=0, M=1 • P=0, M=1 • P=0, M=0 • P=0, M=0 • PT 3 Page 15 • Simplified Example • 16 page virtual address space • Flags • P: Is entry in physical memory? • M: Has this part of VA space been mapped? Page 14 Page 13 Page 12 Page Directory PT 2 MemAddr Page 11 P=1, M=1 • Disk Addr P=1, M=1 • Page 10 P=0, M=0 • Page 9 In Mem P=0, M=1 • PT 0 Page 8 On Disk Page 7 Page 6 Unmapped Page 5 Page 4 Page 3 Page 2 Page 1 Page 0

  30. P6 TLB Translation 32 L2 and DRAM CPU result 20 12 virtual address (VA) VPN VPO L1 miss L1 hit 16 4 TLBT TLBI L1 (128 sets, 4 lines/set) TLB hit TLB miss ... ... TLB (16 sets, 4 entries/set) 10 10 VPN1 VPN2 20 7 5 20 12 CT CI CO PPN PPO physical address (PA) PDE PTE Page tables PDBR

  31. P6 TLB • TLB entry (not all documented, so this is speculative): • V: indicates a valid (1) or invalid (0) TLB entry • TLBTag: disambiguates entries cached in the same set • PPN: translation of the address indicated by index & tag • G: page is “global” according to PDE, PTE • S: page is “supervisor-only” according to PDE, PTE • W: page is writable according to PDE, PTE • D: PTE has already been marked “dirty” (once is enough) • Structure of the data TLB: • 16 sets, 4 entries/set 20 16 1 1 1 1 1 PPN TLBTag S W D V G set 0 entry entry entry entry set 1 entry entry entry entry ... set 15 entry entry entry entry

  32. Translating with the P6 TLB • Partition VPN into TLBT and TLBI. • Is the PTE for VPN cached in set TLBI? • Yes:Check permissions, build physical address • No:Read PTE (and PDE if not cached) from memory and build physical address CPU virtual address 20 12 VPN VPO 16 4 TLBT TLBI 1 2 TLB hit TLB miss 3 PDE PTE ... 20 12 partial TLBhit PPN PPO physical address page table translation 4

  33. P6 TLB Translation 32 L2 and DRAM CPU result 20 12 virtual address (VA) VPN VPO L1 miss L1 hit 16 4 TLBT TLBI L1 (128 sets, 4 lines/set) TLB hit TLB miss ... ... TLB (16 sets, 4 entries/set) 10 10 VPN1 VPN2 20 7 5 20 12 CT CI CO PPN PPO physical address (PA) PDE PTE Page tables PDBR

  34. Translating with the P6 Page Tables(case 1/1) • Case 1/1: page table and page present • MMU Action: • MMU builds physical address and fetches data word • OS action • None 20 12 VPN VPO 20 12 VPN1 VPN2 PPN PPO Mem PDE p=1 PTE p=1 data PDBR Page directory Page table Data page Disk

  35. Translating with the P6 Page Tables(case 1/0) • Case 1/0: page table present, page missing • MMU Action: • Page fault exception • Handler receives the following args: • %eip that caused fault • VA that caused fault • Fault caused by non-present page or page-level protection violation • Read/write • User/supervisor 20 12 VPN VPO VPN1 VPN2 Mem PDE p=1 PTE p=0 PDBR Page directory Page table Disk data Data page

  36. Translating with the P6 Page Tables(case 1/0, cont.) • OS Action: • Check for a legal virtual address. • Read PTE through PDE. • Find free physical page (swapping out current page if necessary) • Read virtual page from disk into physical page • Adjust PTE to point to physical page, set p=1 • Restart faulting instruction by returning from exception handler 20 12 VPN VPO 20 12 VPN1 VPN2 PPN PPO Mem PDE p=1 PTE p=1 data PDBR Page directory Page table Data page Disk

  37. Translating with the P6 Page Tables(case 0/1) • Case 0/1: page table missing, page present • Introduces consistency issue • Potentially every page-out requires update of disk page table • Linux disallows this • If a page table is swapped out, then swap out its data pages too 20 12 VPN VPO VPN1 VPN2 Mem PDE p=0 data PDBR Page directory Data page Disk PTE p=1 Page table

  38. Translating with the P6 Page Tables(case 0/0) • Case 0/0: page table and page missing • MMU Action: • Page fault 20 12 VPN VPO VPN1 VPN2 Mem PDE p=0 PDBR Page directory Disk PTE p=0 data Page table Data page

  39. Translating with the P6 Page Tables(case 0/0, cont.) • OS action: • Swap in page table • Restart faulting instruction by returning from handler • Like case 0/1 from here on. • Two disk reads 20 12 VPN VPO VPN1 VPN2 Mem PDE p=1 PTE p=0 PDBR Page directory Page table Disk data Data page

  40. P6 L1 Cache Access 32 L2 and DRAM CPU result 20 12 virtual address (VA) VPN VPO L1 miss L1 hit 16 4 TLBT TLBI L1 (128 sets, 4 lines/set) TLB hit TLB miss ... ... TLB (16 sets, 4 entries/set) 10 10 VPN1 VPN2 20 7 5 20 12 CT CI CO PPN PPO physical address (PA) PDE PTE Page tables PDBR

  41. L1 Cache Access • Partition physical address: CO, CI, and CT • Use CT to determine if line containing word at address PA is cached in set CI • No: check L2 • Yes: extract word at byte offset CO and return to processor L2 and DRAM 32 data L1 miss L1 hit L1 (128 sets, 4 lines/set) ... 20 7 5 physical address (PA) CT CI CO

  42. Speeding Up L1 Access 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 20 7 5 CT CI CO Physical address (PA) PPN PPO No Change Address Translation CI Virtualaddress (VA) VPN VPO 20 12

  43. x86-64 Paging • Origin • AMD’s way of extending x86 to 64-bit instruction set • Intel has followed with “EM64T” • Requirements • 48-bit virtual address • 256 terabytes (TB) • Not yet ready for full 64 bits • Nobody can buy that much DRAM yet • Mapping tables would be huge • Multi-level array map may not be the right data structure • 52-bit physical address = 40 bits for PPN • Requires 64-bit table entries • Keep traditional x86 4KB page size, and same size for page tables • (4096 bytes per PT) / (8 bytes per PTE) = only 512 entries per page

  44. x86-64 Paging Virtual address 9 9 9 9 12 VPN1 VPN2 VPN3 VPN4 VPO Page Directory Pointer Table Page Directory Table Page Map Table Page Table PM4LE PDPE PDE PTE BR 40 12 Physical address PPN PPO

  45. Today • Virtual memory (VM) • Multi-level page tables • Linux VM system • Case study: VM system on P6 • Performance optimization for VM system

  46. Large Pages 10 12 20 12 • 4MB on 32-bit, 2MB on 64-bit • Simplify address translation • Useful for programs with very large, contiguous working sets • Reduces compulsory TLB misses • How to use (Linux) • hugetlbfs support (since at least 2.6.16) • Use libhugetlbs • {m,c,re}allocreplacements VPN VPO VPN VPO versus 10 12 20 12 PPN PPO PPN PPO

  47. Buffering: Example MMM • Blocked for cache • Assume blocking for L2 cache • say, 512 MB = 219 B = 216 doubles = C • 3B2 < C means B ≈ 150 Block size B x B c a b c = + * i1

  48. Buffering: Example MMM (cont.) • But: Look at one iteration • Consequence • Each row is on different page • More rows than TLB entries: TLB thrashing • Solution: buffering = copy block to contiguous memory • O(B2) cost for O(B3) operations assume > 4 KB = 512 doubles c a b c = + * blocksize B = 150 each row used O(B) times but every time O(B2) ops between

More Related