Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Virtual Memory: Systems CSCE312: Computer Organization.

Slides:



Advertisements
Similar presentations
Virtual Memory October 25, 2006 Topics Address spaces Motivations for virtual memory Address translation Accelerating translation with TLBs class16.ppt.
Advertisements

Carnegie Mellon 1 Virtual Memory: Concepts : Introduction to Computer Systems 15 th Lecture, Oct. 14, 2010 Instructors: Randy Bryant and Dave O’Hallaron.
Instructors: Randy Bryant and Dave O’Hallaron
Today Virtual memory (VM) Overview and motivation
Virtual Memory Nov 27, 2007 Slide Source: Topics Motivations for VM Address translation Accelerating translation with TLBs class12.ppt.
P6/Linux Memory System Oct. 31, 2002
Recitation 7 Greg Reshko Office Hours: Wed 2:00-3:00PM March 31 st, 2003.
Memory System Case Studies Oct. 28, 2004 Topics P6 address translation x86-64 extensions Linux memory management Linux page fault handling Memory mapping.
Virtual Memory October 29, 2007 Topics Address spaces Motivations for virtual memory Address translation Accelerating translation with TLBs class16.ppt.
Virtual Memory May 19, 2008 Topics Motivations for VM Address translation Accelerating translation with TLBs EECS213.
Carnegie Mellon 1 Virtual Memory: Concepts / : Introduction to Computer Systems 16 th Lecture, Oct. 21, 2014 Instructors: Greg Ganger, Greg.
1 Virtual Memory: Systems Level Andrew Case Slides adapted from jinyang Li, Randy Bryant and Dave O’Hallaron.
Carnegie Mellon 1 Saint Louis University Virtual Memory CSCI 224 / ECE 317: Computer Architecture Instructor: Prof. Jason Fritts Slides adapted from Bryant.
Carnegie Mellon /18-243: Introduction to Computer Systems Instructors: Bill Nace and Gregory Kesden (c) All Rights Reserved. All work.
1 Seoul National University Virtual Memory: Systems.
1 Virtual Memory. 2 Outline Pentium/Linux Memory System Core i7 Suggested reading: 9.6, 9.7.
1 Virtual Memory: Concepts Andrew Case Slides adapted from Jinyang Li, Randy Bryant and Dave O’Hallaron.
Carnegie Mellon 1 Virtual Memory: Concepts Instructor: Rabi Mahapatra (TAMU) Slides: Randy Bryant and Dave O’Hallaron (CMU)
Pentium III Memory.
Virtual Memory March 23, 2000 Topics Motivations for VM Address translation Accelerating address translation with TLBs Pentium II/III memory system
Carnegie Mellon Introduction to Computer Systems /18-243, spring th Lecture, Mar. 24 th Instructors: Gregory Kesden and Markus Püschel.
Memory System Case Studies Oct. 31, 2007 Topics P6 address translation x86-64 extensions Linux memory management Linux page fault handling Memory mapping.
Virtual Memory Additional Slides Slide Source: Topics Address translation Accelerating translation with TLBs class12.ppt.
Instructors: Majd Sakr and Khaled Harras
Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Virtual Memory: Concepts Slides adapted from Bryant.
Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Virtual Memory: Concepts CENG331 - Computer Organization.
Carnegie Mellon Introduction to Computer Systems / Spring 2009 March 23, 2009 Virtual Memory.
CS 105 “Tour of the Black Holes of Computing!”
Carnegie Mellon 1 Virtual Memory: Systems / : Introduction to Computer Systems 17 th Lecture, Oct. 27, 2011 Instructors: Dave O’Hallaron,
1 Virtual Memory. 2 Outline Multilevel page tables Different points of view Pentium/Linux Memory System Memory Mapping Suggested reading: 10.6, 10.3,
CSE 153 Design of Operating Systems Winter 2015 Lecture 11: Paging/Virtual Memory Some slides modified from originals by Dave O’hallaron.
P6/Linux Memory System Topics P6 address translation Linux memory management Linux page fault handling memory mapping vm2.ppt CS 105 “Tour of the Black.
1 Virtual Memory. 2 Outline Multilevel page tables Different points of view Pentium/Linux Memory System Memory Mapping Suggested reading: 10.6, 10.3,
Roadmap C: Java: Assembly language: OS: Machine code: Computer system:
Memory System Case Studies Mar. 20, 2008 Topics P6 address translation x86-64 extensions Linux memory management Linux page fault handling Memory mapping.
Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Virtual Memory: Systems CENG331 - Computer Organization.
Carnegie Mellon 1 Virtual Memory: Systems / : Introduction to Computer Systems 17 th Lecture, Mar. 19, 2015 Instructors: Seth Copen Goldstein,
University of Washington Indirection in Virtual Memory 1 Each process gets its own private virtual address space Solves the previous problems Physical.
Virtual Memory: Systems
Alan L. Cox Virtual Memory Alan L. Cox Some slides adapted from CMU slides.
1 Virtual Memory. 2 Outline Case analysis –Pentium/Linux Memory System –Core i7 Suggested reading: 9.7.
Memory System Case Studies Mar. 20, 2008 Topics P6 address translation x86-64 extensions Linux memory management Linux page fault handling Memory mapping.
CS 105 “Tour of the Black Holes of Computing!”
Virtual Memory Samira Khan Apr 27, 2017.
CS 105 “Tour of the Black Holes of Computing!”
Virtual Memory: Systems
Today How was the midterm review? Lab4 due today.
Virtual Memory: Concepts CENG331 - Computer Organization
QuickPath interconnect GB/s GB/s total To I/O
Memory Management and Virtual Memory
CSE 153 Design of Operating Systems Winter 2018
Virtual Memory: Systems /18-213/14-513/15-513: Introduction to Computer Systems 18th Lecture, October 25, 2018.
CS 105 “Tour of the Black Holes of Computing!”
Virtual Memory: Concepts /18-213/14-513/15-513: Introduction to Computer Systems 17th Lecture, October 23, 2018.
Virtual Memory: Systems
Virtual Memory: Systems
Virtual Memory S04, Recitation, Section A
Memory System Case Studies Oct. 13, 2008
Pentium/Linux Memory System
Instructors: Majd Sakr and Khaled Harras
Pentium III / Linux Memory System April 4, 2000
Virtual Memory Nov 27, 2007 Slide Source:
Instructor: Phil Gibbons
Virtual Memory II CSE 351 Winter 2018
CS 105 “Tour of the Black Holes of Computing!”
CS 105 “Tour of the Black Holes of Computing!”
CSE 153 Design of Operating Systems Winter 2019
CS 105 “Tour of the Black Holes of Computing!”
CS703 - Advanced Operating Systems
Instructor: Phil Gibbons
Presentation transcript:

Carnegie Mellon 1 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Virtual Memory: Systems CSCE312: Computer Organization Dec 03, 2015 Instructor: Rabi Mahapatra Slide Source: Randal E. Bryant and David R. O’Hallaron

Carnegie Mellon 2 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Today Simple memory system example Case study: Core i7/Linux memory system

Carnegie Mellon 3 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Review of Symbols Basic Parameters  N = 2 n : Number of addresses in virtual address space  M = 2 m : Number of addresses in physical address space  P = 2 p : 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

Carnegie Mellon 4 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Simple Memory System Example Addressing  14-bit virtual addresses  12-bit physical address  Page size = 64 bytes VPO PPOPPN VPN Virtual Page Number Virtual Page Offset Physical Page Number Physical Page Offset

Carnegie Mellon 5 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition 1. Simple Memory System TLB 16 entries 4-way associative VPO VPN TLBI TLBT 0–021340A10D030–073 0–030–060–080–022 0–0A0–040–0212D –0010D090–030 ValidPPNTagValidPPNTagValidPPNTagValidPPNTagSet

Carnegie Mellon 6 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition 2. Simple Memory System Page Table Only show first 16 entries (out of 256) 10D0F 1110E 12D0D 0–0C 0–0B 1090A ValidPPNVPN 0–07 0– – – ValidPPNVPN

Carnegie Mellon 7 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition 3. Simple Memory System Cache 16 lines, 4-byte block size Physically addressed Direct mapped PPOPPN CO CI CT 03DFC ––––0316 1DF D5 098F6D –––– B2 –––– B3B2B1B0ValidTagIdx ––––014F D31B E D ––––012C ––––00BB 3BDA159312DA –––– A1248 B3B2B1B0ValidTagIdx

Carnegie Mellon 8 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Address Translation Example #1 Virtual Address: 0x03D4 VPN ___TLBI ___TLBT ____ TLB Hit? __Page Fault? __ PPN: ____ Physical Address CO ___CI___CT ____ Hit? __ Byte: ____ VPO VPN TLBI TLBT PPO PPN CO CI CT x0F0x30x03 Y N0x0D x50x0DY0x36

Carnegie Mellon 9 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Address Translation Example #2 Virtual Address: 0x0020 VPN ___TLBI ___TLBT ____ TLB Hit? __Page Fault? __ PPN: ____ Physical Address CO___CI___CT ____ Hit? __ Byte: ____ VPO VPN TLBI TLBT PPO PPN CO CI CT x000 N N0x x80x28NMem

Carnegie Mellon 10 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Today Simple memory system example Case study: Core i7/Linux memory system

Carnegie Mellon 11 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Intel Core i7 Memory System L1 d-cache 32 KB, 8-way L1 d-cache 32 KB, 8-way L2 unified cache 256 KB, 8-way L2 unified cache 256 KB, 8-way L3 unified cache 8 MB, 16-way (shared by all cores) L3 unified cache 8 MB, 16-way (shared by all cores) Main memory Registers L1 d-TLB 64 entries, 4-way L1 d-TLB 64 entries, 4-way L1 i-TLB 128 entries, 4-way L1 i-TLB 128 entries, 4-way L2 unified TLB 512 entries, 4-way L2 unified TLB 512 entries, 4-way L1 i-cache 32 KB, 8-way L1 i-cache 32 KB, 8-way MMU (addr translation) MMU (addr translation) Instruction fetch Instruction fetch Core x4 DDR3 Memory controller 3 x GB/s 32 GB/s total (shared by all cores) DDR3 Memory controller 3 x GB/s 32 GB/s total (shared by all cores) Processor package QuickPath interconnect GB/s each QuickPath interconnect GB/s each To other cores To I/O bridge

Carnegie Mellon 12 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Review of Symbols Basic Parameters  N = 2 n : Number of addresses in virtual address space  M = 2 m : Number of addresses in physical address space  P = 2 p : 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

Carnegie Mellon 13 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition End-to-end Core i7 Address Translation CPU VPNVPO 3612 TLBTTLBI L1 TLB (16 sets, 4 entries/set) VPN1VPN2 99 PTE CR3 PPNPPO 4012 Page tables TLB miss TLB hit Physical address (PA) Result 32/64... CTCO 406 CI 6 L2, L3, and main memory L1 d-cache (64 sets, 8 lines/set) L1 hit L1 miss Virtual address (VA) VPN3VPN4 99 PTE

Carnegie Mellon 14 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Core i7 Level 1-3 Page Table Entries Page table physical base addressUnusedGPSACDWTU/SR/WP=1 Each entry references a 4K child page table. Significant fields: P: Child page table present in physical memory (1) or not (0). R/W: Read-only or read-write access access permission for all reachable pages. U/S: user or supervisor (kernel) mode access permission for all reachable pages. WT: Write-through or write-back cache policy for the child page table. A: Reference bit (set by MMU on reads and writes, cleared by software). PS: Page size either 4 KB or 4 MB (defined for Level 1 PTEs only). Page table physical base address: 40 most significant bits of physical page table address (forces page tables to be 4KB aligned) XD: Disable or enable instruction fetches from all pages reachable from this PTE UnusedXD Available for OS (page table location on disk)P=

Carnegie Mellon 15 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Core i7 Level 4 Page Table Entries Page physical base addressUnusedG D ACDWTU/SR/WP=1 Each entry references a 4K child page. Significant fields: P: Child page is present in memory (1) or not (0) R/W: Read-only or read-write access permission for child page U/S: User or supervisor mode access WT: Write-through or write-back cache policy for this page A: Reference bit (set by MMU on reads and writes, cleared by software) D: Dirty bit (set by MMU on writes, cleared by software) Page physical base address: 40 most significant bits of physical page address (forces pages to be 4KB aligned) XD: Disable or enable instruction fetches from this page UnusedXD Available for OS (page location on disk)P=

Carnegie Mellon 16 Bryant and O’Hallaron, Computer Systems: A Programmer’s Perspective, Third Edition Core i7 Page Table Translation CR3 Physical address of page Physical address of L1 PT 9 VPO 912 Virtual address L4 PT Page table L4 PTE PPNPPO 4012 Physical address Offset into physical and virtual page VPN 3 VPN 4 VPN 2 VPN 1 L3 PT Page middle directory L3 PTE L2 PT Page upper directory L2 PTE L1 PT Page global directory L1 PTE / / / / / 12 / 512 GB region per entry 1 GB region per entry 2 MB region per entry 4 KB region per entry