Seoul National University

Slides:



Advertisements
Similar presentations
Virtual Memory. The Limits of Physical Addressing CPU Memory A0-A31 D0-D31 “Physical addresses” of memory locations Data All programs share one address.
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.
CMPE 421 Parallel Computer Architecture MEMORY SYSTEM.
11/14/05 ELEC Virtual Memory -Neha Jain -Neha Jain.
Cs 325 virtualmemory.1 Accessing Caches in Virtual Memory Environment.
Chapter 101 Virtual Memory Chapter 10 Sections and plus (Skip:10.3.2, 10.7, rest of 10.8)
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.
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
Recap. The Memory Hierarchy Increasing distance from the processor in access time L1$ L2$ Main Memory Secondary Memory Processor (Relative) size of the.
CS 333 Introduction to Operating Systems Class 11 – Virtual Memory (1)
1 Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
The Memory Hierarchy II CPSC 321 Andreas Klappenecker.
1  1998 Morgan Kaufmann Publishers Chapter Seven Large and Fast: Exploiting Memory Hierarchy.
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.
Virtual Memory Topics Virtual Memory Access Page Table, TLB Programming for locality Memory Mountain Revisited.
1 CSE SUNY New Paltz Chapter Seven Exploiting Memory Hierarchy.
Basics of Operating Systems March 4, 2001 Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard.
Virtual Memory Main Memory Magnetic Disk Upper level Lower level.
Seoul National University
Memory/Storage Architecture Lab 1 Virtualization History of Computing = History of Virtualization  e.g., process abstraction, virtual memory, cache memory,
CSE 451: Operating Systems Section 10 Project 3 wrap-up, final exam review.
The Memory Hierarchy 21/05/2009Lecture 32_CA&O_Engr Umbreen Sabir.
Operating Systems COMP 4850/CISG 5550 Page Tables TLBs Inverted Page Tables Dr. James Money.
Virtual Memory By Steven LaBarbera. What I plan to cover  The history of virtual memory  How virtual memory has evolved  How virtual memory is used.
King Fahd University of Petroleum and Minerals King Fahd University of Petroleum and Minerals Computer Engineering Department Computer Engineering Department.
Virtual Memory Part 1 Li-Shiuan Peh Computer Science & Artificial Intelligence Lab. Massachusetts Institute of Technology May 2, 2012L22-1
EEL5708/Bölöni Lec 4.1 Fall 2004 September 10, 2004 Lotzi Bölöni EEL 5708 High Performance Computer Architecture Review: Memory Hierarchy.
Virtual Memory Additional Slides Slide Source: Topics Address translation Accelerating translation with TLBs class12.ppt.
Paging (continued) & Caching CS-3013 A-term Paging (continued) & Caching CS-3013 Operating Systems A-term 2008 (Slides include materials from Modern.
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.
Full and Para Virtualization
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.
CS2100 Computer Organisation Virtual Memory – Own reading only (AY2015/6) Semester 1.
Virtual Memory Ch. 8 & 9 Silberschatz Operating Systems Book.
Protection of Processes Security and privacy of data is challenging currently. Protecting information – Not limited to hardware. – Depends on innovation.
1  1998 Morgan Kaufmann Publishers Chapter Seven.
1  2004 Morgan Kaufmann Publishers Locality A principle that makes having a memory hierarchy a good idea If an item is referenced, temporal locality:
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.
Operating Systems Session 7: – Virtual Memory organization Operating Systems.
Summary of caches: The Principle of Locality: –Program likely to access a relatively small portion of the address space at any instant of time. Temporal.
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.
The Memory Hierarchy Lecture 31 20/07/2009Lecture 31_CA&O_Engr. Umbreen Sabir.
Memory Management memory hierarchy programs exhibit locality of reference - non-uniform reference patterns temporal locality - a program that references.
Memory Management & Virtual Memory. Hierarchy Cache Memory : Provide invisible speedup to main memory.
Virtual Machine Monitors
Virtual Memory So, how is this possible?
Bernhard Boser & Randy Katz
CS352H: Computer Systems Architecture
From Address Translation to Demand Paging
Section 9: Virtual Memory (VM)
From Address Translation to Demand Paging
CS 704 Advanced Computer Architecture
Morgan Kaufmann Publishers
Morgan Kaufmann Publishers Large and Fast: Exploiting Memory Hierarchy
CS510 Operating System Foundations
Lecture 28: Virtual Memory-Address Translation
CSCI206 - Computer Organization & Programming
Morgan Kaufmann Publishers Memory Hierarchy: Virtual Memory
TLB Performance Seung Ki Lee.
Contents Memory types & memory hierarchy Virtual memory (VM)
Computer System Design Lecture 11
Translation Lookaside Buffers
4.3 Virtual Memory.
Manage Your Tasks in Operating System
Memory Management & Virtual Memory
Presentation transcript:

Seoul National University Virtualization

Virtualization History of Computing = History of Virtualization Seoul National University Virtualization Illusion History of Computing = History of Virtualization e.g., process abstraction, virtual memory, cache memory, virtual machine, simultaneous multithreading (SMT),…(the list goes on)

Virtualization Example: Process abstraction Seoul National University Virtualization Example: Process abstraction Source: http://bwrc.eecs.berkeley.edu/CIC/die_photos/21164.gif CPU Time Multiplexing of physical CPU within the operating system (OS) using timer circuit/interrupt + = CPU CPU Single physical CPU Multiple logical CPUs

Virtualization Example: Virtual Machine Seoul National University Virtualization Example: Virtual Machine Thin software layer below operating system Linux Windows XP + = . . . e.g., VMware, VirtualPC, Connectix Virtual PC

Virtualization Example: Cache Memory Seoul National University Virtualization Example: Cache Memory New Memory Technology (Performance: SRAM) (Cost: DRAM) + = SRAM DRAM

Virtualization Example: Virtual Memory Seoul National University Virtualization Example: Virtual Memory Dedicated (virtual) Memory for each process + = Hard Disk DRAM

Two Aspects of Virtualization Seoul National University Two Aspects of Virtualization Functionality Hardware: MMU (memory management unit) and exception mechanism (“page fault”) Software: virtual memory management routines based on page tables, one for each process, in the operating system (OS) Performance Optimizing regular memory references Temporal locality (locality in time) If an item is referenced, it will tend to be referenced again soon. Spatial locality (locality in space) If an item is referenced, items whose addresses are close by will tend to be referenced soon. Optimizing page table references TLB (Translation Look-aside Buffer)

Typical Workload Pattern Seoul National University Typical Workload Pattern Source: Glass & Cao (1997 ACM SIGMETRICS)