CS 61C L25 VM III (1) Garcia, Spring 2004 © UCB TA Chema González www-inst.eecs/~cs61c-td inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.

Slides:



Advertisements
Similar presentations
Virtual Memory In this lecture, slides from lecture 16 from the course Computer Architecture ECE 201 by Professor Mike Schulte are used with permission.
Advertisements

1 Lecture 13: Cache and Virtual Memroy Review Cache optimization approaches, cache miss classification, Adapted from UCB CS252 S01.
Virtual Memory. The Limits of Physical Addressing CPU Memory A0-A31 D0-D31 “Physical addresses” of memory locations Data All programs share one address.
CSIE30300 Computer Architecture Unit 10: Virtual Memory Hsin-Chou Chi [Adapted from material by and
COMP 3221: Microprocessors and Embedded Systems Lectures 27: Virtual Memory - III Lecturer: Hui Wu Session 2, 2005 Modified.
Virtual Memory Adapted from lecture notes of Dr. Patterson and Dr. Kubiatowicz of UC Berkeley.
CS61C L35 VM I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture.
CSCE 212 Chapter 7 Memory Hierarchy Instructor: Jason D. Bakos.
Lecturer PSOE Dan Garcia
CS61C L34 Virtual Memory I (1) Garcia, Spring 2007 © UCB 3D chips from IBM  IBM claims to have found a way to build 3D chips by stacking them together.
Chap. 7.4: Virtual Memory. CS61C L35 VM I (2) Garcia © UCB Review: Caches Cache design choices: size of cache: speed v. capacity direct-mapped v. associative.
CS 61C L24 VM II (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Virtual Memory Adapted from lecture notes of Dr. Patterson and Dr. Kubiatowicz of UC Berkeley and Rabi Mahapatra & Hank Walker.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 34 – Virtual Memory II Jim Cicconi of AT&T says that the surge of video.
CS61C L25 Review Cache © UC Regents 1 CS61C - Machine Structures Lecture 25 - Review Cache/VM December 2, 2000 David Patterson
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
CS 61C L23 VM I (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #23: VM I Andy Carle.
1 Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
CS 61C L24 VM II (1) A Carle, Summer 2005 © UCB inst.eecs.berkeley.edu/~cs61c/su05 CS61C : Machine Structures Lecture #24: VM II Andy Carle.
CS61C L25 Virtual Memory I (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #25.
COMP 3221: Microprocessors and Embedded Systems Lectures 27: Virtual Memory - II Lecturer: Hui Wu Session 2, 2005 Modified.
CS 61C L35 Caches IV / VM I (1) Garcia, Fall 2004 © UCB Andy Carle inst.eecs.berkeley.edu/~cs61c-ta inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS61C L35 Virtual Memory II (1) Garcia, Spring 2007 © UCB Hardware repair?!  This technology allows you to “patch” your hardware after it has been installed.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 35 – Virtual Memory III Researchers at three locations have recently added.
CS61C L34 Virtual Memory II (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c UC Berkeley.
CS61C L26 Virtual Memory II (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #26.
CS61C L36 VM II (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS61C L33 Virtual Memory I (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c UC Berkeley.
©UCB CS 162 Ch 7: Virtual Memory LECTURE 13 Instructor: L.N. Bhuyan
CS 430 – Computer Architecture 1 CS 430 – Computer Architecture Virtual Memory William J. Taffe using slides of David Patterson.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 33 – Virtual Memory I OCZ has released a 1 TB solid state drive (the biggest.
1  2004 Morgan Kaufmann Publishers Chapter Seven.
1 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4 to 6 transistors) DRAM: –value is stored as a charge.
CS 61C: Great Ideas in Computer Architecture
CS 61C L23 Caches IV / VM I (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C :
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 34 – Virtual Memory II Researchers at Stanford have developed “nanoscale.
©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan
COMP3221 lec37-vm-II.1 Saeid Nooshabadi COMP 3221 Microprocessors and Embedded Systems Lectures 13: Virtual Memory - II
CS61C L37 VM III (1)Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS 61C L7.1.2 VM II (1) K. Meinz, Summer 2004 © UCB CS61C : Machine Structures Lecture VM II Kurt Meinz inst.eecs.berkeley.edu/~cs61c.
Lecture 19: Virtual Memory
Lecture Topics: 11/17 Page tables TLBs Virtual memory flat page tables
Instructor: Dan Garcia 1 CS 61C: Great Ideas in Computer Architecture Virtual Memory III.
1 Virtual Memory Main memory can act as a cache for the secondary storage (disk) Advantages: –illusion of having more physical memory –program relocation.
1  1998 Morgan Kaufmann Publishers Recap: Memory Hierarchy of a Modern Computer System By taking advantage of the principle of locality: –Present the.
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 35 – Virtual Memory III ”The severity of the decline in the market is further evidence.
Virtual Memory. Virtual Memory: Topics Why virtual memory? Virtual to physical address translation Page Table Translation Lookaside Buffer (TLB)
Review (1/2) °Caches are NOT mandatory: Processor performs arithmetic Memory stores data Caches simply make data transfers go faster °Each level of memory.
1 Some Real Problem  What if a program needs more memory than the machine has? —even if individual programs fit in memory, how can we run multiple programs?
Review °Apply Principle of Locality Recursively °Manage memory to disk? Treat as cache Included protection as bonus, now critical Use Page Table of mappings.
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
1 Chapter Seven CACHE MEMORY AND VIRTUAL MEMORY. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4.
Csci 136 Computer Architecture II – Virtual Memory
1 Chapter Seven. 2 Users want large and fast memories! SRAM access times are ns at cost of $100 to $250 per Mbyte. DRAM access times are ns.
1  1998 Morgan Kaufmann Publishers Chapter Seven.
LECTURE 12 Virtual Memory. VIRTUAL MEMORY Just as a cache can provide fast, easy access to recently-used code and data, main memory acts as a “cache”
1 Chapter Seven. 2 SRAM: –value is stored on a pair of inverting gates –very fast but takes up more space than DRAM (4 to 6 transistors) DRAM: –value.
CS203 – Advanced Computer Architecture Virtual Memory.
CS161 – Design and Architecture of Computer
Lecturer PSOE Dan Garcia
Virtual Memory Chapter 7.4.
CS161 – Design and Architecture of Computer
Lecture 12 Virtual Memory.
CS 704 Advanced Computer Architecture
There is one handout today at the front and back of the room!
Lecture 14 Virtual Memory and the Alpha Memory Hierarchy
Csci 211 Computer System Architecture – Review on Virtual Memory
Some of the slides are adopted from David Patterson (UCB)
Albert Chae, Instructor
Presentation transcript:

CS 61C L25 VM III (1) Garcia, Spring 2004 © UCB TA Chema González www-inst.eecs/~cs61c-td inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 25 –VM III Netsky/Bagle/MyDoom War "Hey, Netsky...don't ruine (sp) our bussiness (sp), wanna start a war?" [Bagle.J worm's code]

CS 61C L25 VM III (2) Garcia, Spring 2004 © UCB Review… Manage memory to disk? Treat as cache Included protection as bonus, now critical Use Page Table of mappings for each user vs. tag/data in cache TLB is cache of Page Table Virtual Memory allows protected sharing of memory between processes Spatial Locality means Working Set of Pages is all that must be in memory for process to run fairly well

CS 61C L25 VM III (3) Garcia, Spring 2004 © UCB Locality… Spatial Locality != Temporal Locality SL: If I access X, I’ll (probably) stay close TL: If I access X, I’ll (probably) get back soon Normally both hold, but… Sequential memory access: SL, not TL Lab8 experiment, large stride: TL, not SL

CS 61C L25 VM III (4) Garcia, Spring 2004 © UCB Peer Instructions A. Locality is important yet different for cache and virtual memory (VM): temporal locality for caches but spatial locality for VM B. Cache management is done by hardware (HW), page table management by the operating system (OS), but TLB management is either by HW or OS C. VM helps both with security and cost ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

CS 61C L25 VM III (5) Garcia, Spring 2004 © UCB Peer Instruction 1. Locality is important yet different for cache and virtual memory (VM): temporal locality for caches but spatial locality for VM 2. Cache management is done by hardware (HW), page table management by the operating system (OS), but TLB management is either by HW or OS 3. VM helps both with security and cost T R U E F A L S E 1. No. Both for VM and cache 2. Yes. TLB SW (MIPS) or HW ($ HW, Page table OS) 3. Yes. Protection and a bit smaller memory T R U E ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

CS 61C L25 VM III (6) Garcia, Spring 2004 © UCB Virtual Memory Problem #1 Slow: Every memory access requires: -1 access to PT to get VPN->PPN translation -1 access to MEM to get data at PA Solution: Cache the Page Table -Make common case fast -PT cache called “TLB” “block size” is just 1 VA->PA mapping TLB associativity?

CS 61C L25 VM III (7) Garcia, Spring 2004 © UCB Virtual Memory Problem #2 Page Table too big! 4GB Virtual Memory ÷ 1 KB page  ~ 4 million Page Table Entries  16 MB just for Page Table for 1 process, 8 processes  256 MB for Page Tables! Spatial Locality to the rescue Each page is 4 KB, lots of nearby references But large page size wastes resources No matter how big program is, at any time only accessing a few pages “Working Set”: recently used pages

CS 61C L25 VM III (8) Garcia, Spring 2004 © UCB Solutions Page the Page Table itself! Works, but must be careful with never- ending page faults Pin some PT pages to memory 2-level page table Solutions tradeoff in-memory PT size for slower TLB miss Make TLB large enough, highly associative so rarely miss on address translation CS 162 will go over more options and in greater depth

CS 61C L25 VM III (9) Garcia, Spring 2004 © UCB 2-level Page Table 0 Physical Memory 64 MB Virtual Memory  Code Static Heap Stack nd Level Page Tables Super Page Table

CS 61C L25 VM III (10) Garcia, Spring 2004 © UCB Page Table Shrink : Single Page Table Page Number Offset 20 bits12 bits Multilevel Page Table Page NumberSuper Page No. Offset 10 bits 12 bits Only have second level page table for valid entries of super level page table Exercise 7.35 explores exact space savings

CS 61C L25 VM III (11) Garcia, Spring 2004 © UCB Three Advantages of Virtual Memory 1) Translation: Program can be given consistent view of memory, even though physical memory is scrambled (illusion of contiguous memory) All programs starting at same set address Illusion of ~ infinite memory (2 32 or 2 64 bytes) Makes multiple processes reasonable Only the most important part of program (“Working Set”) must be in physical memory Contiguous structures (like stacks) use only as much physical memory as necessary yet still grow later

CS 61C L25 VM III (12) Garcia, Spring 2004 © UCB Three Advantages of Virtual Memory User program view of memory: Contiguous Start from some set address Infinitely large Is the only running program Reality: Non-contiguous Start wherever available memory is Finite size Many programs running at a time

CS 61C L25 VM III (13) Garcia, Spring 2004 © UCB Three Advantages of Virtual Memory 2) Protection: Different processes protected from each other Different pages can be given special behavior - (Read Only, Invisible to user programs, etc). Kernel data protected from User programs Very important for protection from malicious programs Special Mode in processor (“Kernel more”) allows processor to change page table/TLB 3) Sharing: Can map same physical page to multiple users (“Shared memory”)

CS 61C L25 VM III (14) Garcia, Spring 2004 © UCB Virtual Memory Overview Let’s say we’re fetching some data: Check TLB (input: VPN, output: PPN) -hit: fetch translation -miss: check page table (in memory) –page table hit: fetch translation –page table miss: page fault, fetch page from disk to memory, return translation to TLB Check cache (input: PPN, output: data) -hit: return value -miss: fetch value from memory

CS 61C L25 VM III (15) Garcia, Spring 2004 © UCB A: A: 1 2 TRUE B: B: 1 3 TRUE C: C: 2 3 TRUE D: D: 1 TRUE E: E: 2 TRUE F: F: ALL FALSE Peer Instruction 1. Increasing at least one of {associativity, block size} is always a win 2. Higher DRAM bandwidth translates to a lower miss rate 3. DRAM access time improves roughly as fast as density

CS 61C L25 VM III (16) Garcia, Spring 2004 © UCB A: A: 1 2 TRUE B: B: 1 3 TRUE C: C: 2 3 TRUE D: D: 1 TRUE E: E: 2 TRUE F: F: ALL FALSE Peer Instruction Answers 1. Increasing at least one of {associativity, block size} is always a win 2. Higher DRAM bandwidth translates to a lower miss rate 3. DRAM access time improves roughly as fast as density F A L S E 1. Assoc. may increase access time, block may increase miss penalty 2. No, a lower miss penalty 3. No, access = 9%/year, but density = 2x every 2 yrs! F A L S E

CS 61C L25 VM III (17) Garcia, Spring 2004 © UCB Address Translation & 3 Concept tests PPNOffset Physical Address VPNOffset Virtual Address INDEX TLB Physical Page Number P. P. N.... V. P. N. Virtual Page Number V. P. N. TAGOffsetINDEX Data Cache Tag Data

CS 61C L25 VM III (18) Garcia, Spring 2004 © UCB Peer Instruction (1/3) 40-bit virtual address, 16 KB page 36-bit physical address Number of bits in Virtual Page Number/ Page offset, Physical Page Number/Page offset? Page Offset (? bits)Virtual Page Number (? bits) Page Offset (? bits)Physical Page Number (? bits) A: A: 22/18 (VPN/PO), 22/14 (PPN/PO) B: B: 24/16, 20/16 C: C: 26/14, 22/14 D: D: 26/14, 26/10 E: E: 28/12, 24/12

CS 61C L25 VM III (19) Garcia, Spring 2004 © UCB Peer Instruction (1/3) Answer 40-bit virtual address, 16 KB (2 14 B) 36-bit physical address, 16 KB (2 14 B) Number of bits in Virtual Page Number/ Page offset, Physical Page Number/Page offset? Page Offset (14 bits)Virtual Page Number (26 bits) Page Offset (14 bits)Physical Page Number (22 bits) A: A: 22/18 (VPN/PO), 22/14 (PPN/PO) B: B: 24/16, 20/16 C: C: 26/14, 22/14 D: D: 26/14, 26/10 E: E: 28/12, 24/12

CS 61C L25 VM III (20) Garcia, Spring 2004 © UCB Peer Instruction (2/3): 40b VA, 36b PA 2-way set-assoc. TLB, 256 entries, 40b VA: TLB Entry: Valid bit, Dirty bit, Access Control (say 2 bits), Virtual Page Number, Physical Page Number Number of bits in TLB Tag / Index / Entry? Page Offset (14 bits)TLB Index (? bits)TLB Tag (? bits) VD Access (2 bits)Physical Page No. (? bits) A: A: 12 / 14 / 38 (TLB Tag / Index / Entry) B: B: 14 / 12 / 40 C: C: 19 / 7 / 45 D: D: 19 / 7 / 58

CS 61C L25 VM III (21) Garcia, Spring 2004 © UCB A: A: 12 / 14 / 38 (TLB Tag / Index / Entry) B: B: 14 / 12 / 40 C: C: 18 / 8 / 45 D: D: 18 / 8 / 58 Peer Instruction (2/3) Answer 2-way set-assoc data cache, 256 (2 8 ) entries, 2 entries per set => 2 7 sets (7-bit index) Data Cache Entry: Valid bit, Dirty bit, Access Control (2 bits?), Virtual Page Number, Physical Page Number Page Offset (14 bits) Virtual Page Number (26 bits) TLB Index (7 bits)TLB Tag (19 bits) VD Access (2 bits)Physical Page No. (22 bits)

CS 61C L25 VM III (22) Garcia, Spring 2004 © UCB Peer Instruction (3/3) 2-way set-assoc, 64KB data cache, 64B block Data Cache Entry: Valid bit, Dirty bit, Cache tag + ? bits of Data Number of bits in Data cache Tag / Index / Offset / Entry? Block Offset (? bits) Physical Page Address (36 bits) Cache Index (? bits)Cache Tag (? bits) VD Cache Data (? bits) A: A: 12 / 9 / 14 / 87 (Tag/Index/Offset/Entry) B: B: 20 / 10 / 6 / 86 C: C: 20 / 10 / 6 / 534 D: D: 21 / 9 / 6 / 87 E: E: 21 / 9 / 6 / 535

CS 61C L25 VM III (23) Garcia, Spring 2004 © UCB Peer Instruction (3/3) Answer 64 KB / 64 B = 1K blocks, 2-way set-assoc data cache => 1K / 2 = 512 sets (9 bit index) Data Cache Entry: Valid bit, Dirty bit, Cache tag + 64 Bytes of Data Block Offset (6 bits) Physical Page Address (36 bits) Cache Index (9 bits)Cache Tag (21 bits) VD Cache Data (64 Bytes/ 512 bits) A: A: 12 / 9 / 14 / 87 (Tag/Index/Offset/Entry) B: B: 20 / 10 / 6 / 86 C: C: 20 / 10 / 6 / 534 D: D: 21 / 9 / 6 / 87 E: E: 21 / 9 / 6 / 535

CS 61C L25 VM III (24) Garcia, Spring 2004 © UCB $&VM Review: 4 Qs for any Mem. Hierarchy Q1: Where can a block be placed in the upper level? (Block placement) Q2: How is a block found if it is in the upper level? (Block identification) Q3: Which block should be replaced on a miss? (Block replacement) Q4: What happens on a write? (Write strategy)

CS 61C L25 VM III (25) Garcia, Spring 2004 © UCB Block 12 placed in 8 block cache: Fully associative, direct mapped, 2-way set associative S.A. Mapping = Block Number Mod Number Sets Block no. Fully associative: block 12 can go anywhere Block no. Direct mapped: block 12 can go only into block 4 (12 mod 8) Block no. Set associative: block 12 can go anywhere in set 0 (12 mod 4) Set 0 Set 1 Set 2 Set Block-frame address Block no. Q1: Where block placed in upper level?

CS 61C L25 VM III (26) Garcia, Spring 2004 © UCB Direct indexing (using index and block offset), tag compares, or combination Increasing associativity shrinks index, expands tag Block offset Block Address Tag Index Q2: How is a block found in upper level? Set Select Data Select

CS 61C L25 VM III (27) Garcia, Spring 2004 © UCB Easy for Direct Mapped Set Associative or Fully Associative: Random LRU (Least Recently Used) Miss Rates Associativity:2-way 4-way 8-way SizeLRU Ran LRU Ran LRU Ran 16 KB5.2%5.7% 4.7%5.3% 4.4%5.0% 64 KB1.9%2.0% 1.5%1.7% 1.4%1.5% 256 KB1.15%1.17% 1.13% 1.13% 1.12% 1.12% Q3: Which block replaced on a miss?

CS 61C L25 VM III (28) Garcia, Spring 2004 © UCB Q4: What to do on a write hit? Write-through update the word in cache block and corresponding word in memory Write-back update word in cache block allow memory word to be “stale” => add ‘dirty’ bit to each line indicating that memory be updated when block is replaced => OS flushes cache before I/O !!! Performance trade-offs? WT: read misses cannot result in writes WB: no writes of repeated writes

CS 61C L25 VM III (29) Garcia, Spring 2004 © UCB In Conclusion… Virtual memory to Physical Memory Translation too slow? Add a cache of Virtual to Physical Address Translations, called a TLB Need more compact representation to reduce memory size cost of simple 1-level page table (especially 32-  64-bit address) Spatial Locality means Working Set of Pages is all that must be in memory for process to run fairly well Virtual Memory allows protected sharing of memory between processes with less swapping to disk