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)

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

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 153 Design of Operating Systems Spring 2015
The Memory Hierarchy (Lectures #24) ECE 445 – Computer Organization The slides included herein were taken from the materials accompanying Computer Organization.
Virtual Memory Chapter 8.
CSCE 212 Chapter 7 Memory Hierarchy Instructor: Jason D. Bakos.
S.1 Review: The Memory Hierarchy Increasing distance from the processor in access time L1$ L2$ Main Memory Secondary Memory Processor (Relative) size of.
CS 333 Introduction to Operating Systems Class 11 – Virtual Memory (1)
The Memory Hierarchy II CPSC 321 Andreas Klappenecker.
Translation Buffers (TLB’s)
Virtual Memory and Paging J. Nelson Amaral. Large Data Sets Size of address space: – 32-bit machines: 2 32 = 4 GB – 64-bit machines: 2 64 = a huge number.
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
Linux Booting Procedure
Computer Architecture Lecture 28 Fasih ur Rehman.
Some VM Complications Extra memory accesses Page tables are huge
CSE431 L22 TLBs.1Irwin, PSU, 2005 CSE 431 Computer Architecture Fall 2005 Lecture 22. Virtual Memory Hardware Support Mary Jane Irwin (
Lecture 19: Virtual Memory
Virtual Memory CS Introduction to Operating Systems.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
Operating Systems ECE344 Ding Yuan Paging Lecture 8: Paging.
July 30, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 8: Exploiting Memory Hierarchy: Virtual Memory * Jeremy R. Johnson Monday.
IT253: Computer Organization
Lecture Topics: 11/17 Page tables TLBs Virtual memory flat page tables
Operating Systems COMP 4850/CISG 5550 Page Tables TLBs Inverted Page Tables Dr. James Money.
Virtual Memory Expanding Memory Multiple Concurrent Processes.
CS 149: Operating Systems March 3 Class Meeting Department of Computer Science San Jose State University Spring 2015 Instructor: Ron Mak
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. Virtual Memory: Topics Why virtual memory? Virtual to physical address translation Page Table Translation Lookaside Buffer (TLB)
4.3 Virtual Memory. Virtual memory  Want to run programs (code+stack+data) larger than available memory.  Overlays programmer divides program into pieces.
Multilevel Caches Microprocessors are getting faster and including a small high speed cache on the same chip.
CS2100 Computer Organisation Virtual Memory – Own reading only (AY2015/6) Semester 1.
CS.305 Computer Architecture Memory: Virtual Adapted from Computer Organization and Design, Patterson & Hennessy, © 2005, and from slides kindly made available.
Virtual Memory Ch. 8 & 9 Silberschatz Operating Systems Book.
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)
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.
CDA 5155 Virtual Memory Lecture 27. Memory Hierarchy Cache (SRAM) Main Memory (DRAM) Disk Storage (Magnetic media) CostLatencyAccess.
Virtual Memory Chapter 8.
CS161 – Design and Architecture of Computer
Lecture 11 Virtual Memory
ECE232: Hardware Organization and Design
Memory COMPUTER ARCHITECTURE
CS161 – Design and Architecture of Computer
Virtual Memory: the Page Table and Page Swapping
Lecture 12 Virtual Memory.
Virtual Memory User memory model so far:
Today How was the midterm review? Lab4 due today.
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.
CSCI206 - Computer Organization & Programming
Chapter 8 Digital Design and Computer Architecture: ARM® Edition
Morgan Kaufmann Publishers Memory Hierarchy: Virtual Memory
Translation Buffers (TLB’s)
Virtual Memory Overcoming main memory size limitation
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
CSE451 Virtual Memory Paging Autumn 2002
Translation Buffers (TLB’s)
CSE 451: Operating Systems Autumn 2003 Lecture 10 Paging & TLBs
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.
Sarah Diesburg Operating Systems CS 3430
Review What are the advantages/disadvantages of pages versus segments?
Virtual Memory.
4.3 Virtual Memory.
Sarah Diesburg Operating Systems COP 4610
Virtual Memory 1 1.
Presentation transcript:

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) Page might be in physical memory or on disk. Addresses: Generated by lw/sw: virtual Actual memory locations: physical

Memory access Load/store/PC computes a virtual address Need address translation Convert virtual addr to physical addr Use page table for lookup Check virtual address: If page is in memory, access memory with physical address May also need to check access permissions If page is in not in memory, access disk Page fault Slow – so run another program while it’s doing that Do translation in hardware Software translation would be too slow!

Handling a page fault Occurs during memory access clock cycle Handler must: Find disk address from page table entry Choose physical page to replace if page dirty, write to disk first Read referenced page from disk into physical page

TLB: Translation Lookaside Buffer Address translation has a high degree of locality If page accessed once, highly likely to be accessed again soon. So, cache a few frequently used page table entries TLB = hardware cache for the page table Make translation faster Small, usually fully-associative TLB entries contain Valid bit = TLB hit Other housekeeping bits Tag = virtual page number Data = Physical page number Misses handled in hardware (dedicated FSM) or software (OS code reads page table)

TLB Misses TLB miss means one of two things Page is present in memory, need to create the missing mapping in the TLB Page is not present in memory (page fault), need to transfer control to OS to deal with it. Need to generate an exception Copy page table entry to TLB – use appropriate replacement algorithm if you need to evict an entry from TLB.

Optimizations Make the common case fast Speed up TLB hit + L1 Cache hit Do TLB lookup and cache lookup in parallel Possible if cache index is independent of virtual address translation Have cache indexed by virtual addresses

TLB Example , 7.33 Given: 40-bit virtual addr 16KB pages 36-bit physical byte address 2-way set associative TLB with 256 total entries Total page table size? Memory organization?

Page table/address parameters 16KB=2^14, so 16K pages need 14 bits for an offset inside a page. The rest of the virtual address is the virtual page index, and it's = 26 bits long, for 2^26 page table entries. Each entry contains 4 bits for valid/protection/dirty information, and the physical frame number, which is = 22 bits long, for a total of 26 bits. The total page table size is then 26 bits * 2^26 entries = 208 MB

Memory organization tagindexpage offset 26-bit virtual page number valid/etc. Tagphysical page # valid/etc. tagphysical page # ………… == 2-1 MUX 22 physical page #page offset Physical Address 2214 TLB: 128 sets, each w/2 entries

Fun stuff: bootstrapping on x86 You power up your PC, what happens? Hardware reset Initialize all bits of cache, regs, buffers, etc. to a known value; go to real mode EIP (PC) initialized to 0x0000FFF0, base address (CS) initialized to 0xFFFF0000 So execution begins at 0xFFFFFFF0, 16 bytes from top of physical memory, in EPROM. EPROM remapped to this high address by system chipset First things to execute in EPROM set up IDT = interrupt descriptor table Jump to the BIOS

Bootstrapping 2 BIOS: basic input/output system Built-in software that determines what a computer can do without accessing programs from a disk Placed in ROM chip that comes with the PC BIOS and booting BIOS will search devices in specified order for bootable ones Take the current boot disk Load first sector (usually 512 bytes) at 0000:7C00. Look for a special signature (0xAA55) at the end of it (the last two bytes) Signature not there: “Invalid / Non System Disk” error If signature ok, start executing code in this sector Code limited to 512 bytes! Probably jump to secondary boot program, which will load OS

Bootstrapping 3 For hard disks, first sector is the MBR = Master Boot Record MBR has three parts Code to load a bootsector from one of four primary partitions Top level partition table for hard drive, at offset 446. Has four 16-byte records. Magic values at offsets : 0xAA55 Sector 0 of HD partition contains actual bootloader. Either finds/loads OS, or loads secondary bootloader

Inside a bootloader Get disk geometry for floppies Find second-stage loader if need >512 bytes for code. Load it Get/check system info Check for 32-bit CPU Check for fast enough CPU Detect drives and their geometries Find/load config file Present a boot menu to the user Store magic values – which bootloader was used, drive we booted from, etc. Find/validate/copy/load kernel Floppy: when done loading, turn off floppy drive motor :) mov dx,3F2h mov al,0 out dx,al