Virtual Memory Ch. 8 & 9 Silberschatz Operating Systems Book.

Slides:



Advertisements
Similar presentations
Virtual Memory 1 Computer Organization II © McQuain Virtual Memory Use main memory as a cache for secondary (disk) storage – Managed jointly.
Advertisements

Virtual Memory In this lecture, slides from lecture 16 from the course Computer Architecture ECE 201 by Professor Mike Schulte are used with permission.
Morgan Kaufmann Publishers Large and Fast: Exploiting Memory Hierarchy
1 Lecture 13: Cache and Virtual Memroy Review Cache optimization approaches, cache miss classification, Adapted from UCB CS252 S01.
EECS 470 Virtual Memory Lecture 15. Why Use Virtual Memory? Decouples size of physical memory from programmer visible virtual memory Provides a convenient.
Virtual Memory main memory can act as a cache for secondary storage motivation: Allow programs to use more memory that there is available transparent to.
Computer Organization CS224 Fall 2012 Lesson 44. Virtual Memory  Use main memory as a “cache” for secondary (disk) storage l Managed jointly by CPU hardware.
Lecture 34: Chapter 5 Today’s topic –Virtual Memories 1.
CSIE30300 Computer Architecture Unit 10: Virtual Memory Hsin-Chou Chi [Adapted from material by and
Virtual Memory Hardware Support
Cs 325 virtualmemory.1 Accessing Caches in Virtual Memory Environment.
Memory/Storage Architecture Lab Computer Architecture Virtual Memory.
The Memory Hierarchy (Lectures #24) ECE 445 – Computer Organization The slides included herein were taken from the materials accompanying Computer Organization.
CSCE 212 Chapter 7 Memory Hierarchy Instructor: Jason D. Bakos.
1 Lecture 20 – Caching and Virtual Memory  2004 Morgan Kaufmann Publishers Lecture 20 Caches and Virtual Memory.
S.1 Review: The Memory Hierarchy Increasing distance from the processor in access time L1$ L2$ Main Memory Secondary Memory Processor (Relative) size of.
Translation Buffers (TLB’s)
©UCB CS 162 Ch 7: Virtual Memory LECTURE 13 Instructor: L.N. Bhuyan
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy (Part II)
©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan
Morgan Kaufmann Publishers Large and Fast: Exploiting Memory Hierarchy
Lecture 33: Chapter 5 Today’s topic –Cache Replacement Algorithms –Multi-level Caches –Virtual Memories 1.
Computer Architecture Lecture 28 Fasih ur Rehman.
Some VM Complications Extra memory accesses Page tables are huge
Lecture 19: Virtual Memory
Lecture 15: Virtual Memory EEN 312: Processors: Hardware, Software, and Interfacing Department of Electrical and Computer Engineering Spring 2014, Dr.
July 30, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 8: Exploiting Memory Hierarchy: Virtual Memory * Jeremy R. Johnson Monday.
Virtual Memory Expanding Memory Multiple Concurrent Processes.
Morgan Kaufmann Publishers
Virtual Memory Part 1 Li-Shiuan Peh Computer Science & Artificial Intelligence Lab. Massachusetts Institute of Technology May 2, 2012L22-1
1 Virtual Memory Main memory can act as a cache for the secondary storage (disk) Advantages: –illusion of having more physical memory –program relocation.
Virtual Memory Lecture for CPSC 5155 Edward Bosworth, Ph.D. Computer Science Department Columbus State University.
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?
CS2100 Computer Organisation Cache II (AY2010/2011) Semester 2.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Demand Paging.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
1  2004 Morgan Kaufmann Publishers Chapter Seven Memory Hierarchy-3 by Patterson.
CS2100 Computer Organisation Virtual Memory – Own reading only (AY2015/6) Semester 1.
Virtual Memory Review Goal: give illusion of a large memory Allow many processes to share single memory Strategy Break physical memory up into blocks (pages)
Constructive Computer Architecture Virtual Memory: From Address Translation to Demand Paging Arvind Computer Science & Artificial Intelligence Lab. Massachusetts.
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”
Virtual Memory 1 Computer Organization II © McQuain Virtual Memory Use main memory as a “cache” for secondary (disk) storage – Managed jointly.
Chapter 7 Large and Fast: Exploiting Memory Hierarchy.
CS161 – Design and Architecture of Computer
Lecture 11 Virtual Memory
ECE232: Hardware Organization and Design
Memory COMPUTER ARCHITECTURE
Virtual Memory Lecture notes from MKP and S. Yalamanchili.
CS161 – Design and Architecture of Computer
CS352H: Computer Systems Architecture
Lecture 12 Virtual Memory.
Section 9: Virtual Memory (VM)
Virtual Memory User memory model so far:
Virtual Memory Use main memory as a “cache” for secondary (disk) storage Managed jointly by CPU hardware and the operating system (OS) Programs share main.
Morgan Kaufmann Publishers
Morgan Kaufmann Publishers
Morgan Kaufmann Publishers Large and Fast: Exploiting Memory Hierarchy
COSC121: Computer Systems. Managing Memory
Chapter 4 Large and Fast: Exploiting Memory Hierarchy Part 2 Virtual Memory 박능수.
ECE 445 – Computer Organization
Morgan Kaufmann Publishers Memory Hierarchy: Virtual Memory
Translation Buffers (TLB’s)
Translation Buffers (TLB’s)
CSC3050 – Computer Architecture
Computer Architecture
Virtual Memory Lecture notes from MKP and S. Yalamanchili.
Translation Buffers (TLBs)
Virtual Memory Use main memory as a “cache” for secondary (disk) storage Managed jointly by CPU hardware and the operating system (OS) Programs share main.
Virtual Memory.
Review What are the advantages/disadvantages of pages versus segments?
Presentation transcript:

Virtual Memory Ch. 8 & 9 Silberschatz Operating Systems Book

Virtual Memory Use main memory as a “cache” for secondary (disk) storage – Managed jointly by CPU hardware and the operating system (OS) Programs share main memory – Each gets a private virtual address space holding its frequently used code and data – Protected from other programs CPU and OS translate virtual addresses to physical addresses – VM “block” is called a page – VM translation “miss” is called a page fault Memor Hierarchy, Caching, & Virtual Memory §5.4 Virtual Memory

Address Translation Fixed-size pages (e.g., 4K) Memor Hierarchy, Caching, & Virtual Memory

Page Fault Penalty On page fault, the page must be fetched from disk – Takes millions of clock cycles – Handled by OS code Try to minimize page fault rate – Fully associative placement – Smart replacement algorithms Memor Hierarchy, Caching, & Virtual Memory

Page Tables Stores placement information – Array of page table entries, indexed by virtual page number – Page table register in CPU points to page table in physical memory If page is present in memory – PTE stores the physical page number – Plus other status bits (referenced, dirty, …) If page is not present – PTE can refer to location in swap space on disk Memor Hierarchy, Caching, & Virtual Memory

Translation Using a Page Table Memor Hierarchy, Caching, & Virtual Memory

Mapping Pages to Storage Memor Hierarchy, Caching, & Virtual Memory

Replacement and Writes To reduce page fault rate, prefer least-recently used (LRU) replacement – Reference bit (aka use bit) in PTE set to 1 on access to page – Periodically cleared to 0 by OS – A page with reference bit = 0 has not been used recently Disk writes take millions of cycles – Block at once, not individual locations – Write through is impractical – Use write-back – Dirty bit in PTE set when page is written Memor Hierarchy, Caching, & Virtual Memory

Fast Translation Using a TLB Address translation would appear to require extra memory references – One to access the PTE – Then the actual memory access But access to page tables has good locality – So use a fast cache of PTEs within the CPU – Called a Translation Look-aside Buffer (TLB) – Typical: 16–512 PTEs, 0.5–1 cycle for hit, 10–100 cycles for miss, 0.01%–1% miss rate – Misses could be handled by hardware or software Memor Hierarchy, Caching, & Virtual Memory

Fast Translation Using a TLB Memor Hierarchy, Caching, & Virtual Memory

TLB Misses If page is in memory – Load the PTE from memory and retry – Could be handled in hardware Can get complex for more complicated page table structures – Or in software Raise a special exception, with optimized handler If page is not in memory (page fault) – OS handles fetching the page and updating the page table – Then restart the faulting instruction Memor Hierarchy, Caching, & Virtual Memory

TLB Miss Handler TLB miss indicates – Page present, but PTE not in TLB – Page not preset Must recognize TLB miss before destination register overwritten – Raise exception Handler copies PTE from memory to TLB – Then restarts instruction – If page not present, page fault will occur Memor Hierarchy, Caching, & Virtual Memory

Page Fault Handler Use faulting virtual address to find PTE Locate page on disk Choose page to replace – If dirty, write to disk first Read page into memory and update page table Make process runnable again – Restart from faulting instruction Memor Hierarchy, Caching, & Virtual Memory

TLB and Cache Interaction If cache tag uses physical address – Need to translate before cache lookup Alternative: use virtual address tag – Complications due to aliasing Different virtual addresses for shared physical address Memor Hierarchy, Caching, & Virtual Memory

Memory Protection Different tasks can share parts of their virtual address spaces – But need to protect against errant access – Requires OS assistance Hardware support for OS protection – Privileged supervisor mode (aka kernel mode) – Privileged instructions – Page tables and other state information only accessible in supervisor mode – System call exception (e.g., syscall in MIPS) Memor Hierarchy, Caching, & Virtual Memory