CPSC 457 Operating Systems

Slides:



Advertisements
Similar presentations
Memory.
Advertisements

Basic Memory Management Monoprogramming Protection Swapping Overlaying OS space User space.
Part IV: Memory Management
OS Fall’02 Virtual Memory Operating Systems Fall 2002.
1 Memory Systems Virtual Memory Lecture 25 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
CS 153 Design of Operating Systems Spring 2015
OS Spring ‘04 Paging and Virtual Memory Operating Systems Spring 2004.
Multiprocessing Memory Management
Paging and Virtual Memory. Memory management: Review  Fixed partitioning, dynamic partitioning  Problems Internal/external fragmentation A process can.
Memory Management. 2 How to create a process? On Unix systems, executable read by loader Compiler: generates one object file per source file Linker: combines.
Memory Management 2010.
Chapter 3.2 : Virtual Memory
1 Friday, June 30, 2006 "Man's mind, once stretched by a new idea, never regains its original dimensions." - Oliver Wendell Holmes, Jr.
Computer Organization Cs 147 Prof. Lee Azita Keshmiri.
03/22/2004CSCI 315 Operating Systems Design1 Virtual Memory Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Memory Management April 28, 2000 Instructor: Gary Kimura.
U NIVERSITY OF M ASSACHUSETTS, A MHERST Department of Computer Science Emery Berger University of Massachusetts, Amherst Operating Systems CMPSCI 377 Lecture.
Basics of Operating Systems March 4, 2001 Adapted from Operating Systems Lecture Notes, Copyright 1997 Martin C. Rinard.
Virtual Memory Chantha Thoeun. Overview  Purpose:  Use the hard disk as an extension of RAM.  Increase the available address space of a process. 
Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.
Chapter 8: Main Memory. 8.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 8: Memory Management Background Swapping Contiguous.
Review of Memory Management, Virtual Memory CS448.
Cosc 2150: Computer Organization Chapter 6, Part 2 Virtual Memory.
1 Chapter 3.2 : Virtual Memory What is virtual memory? What is virtual memory? Virtual memory management schemes Virtual memory management schemes Paging.
Memory Management – Page 1 of 49CSCI 4717 – Computer Architecture Memory Management Uni-program – memory split into two parts –One for Operating System.
Chapter 8 – Main Memory (Pgs ). Overview  Everything to do with memory is complicated by the fact that more than 1 program can be in memory.
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-8 Memory Management (2) Department of Computer Science and Software.
8.1 Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Paging Physical address space of a process can be noncontiguous Avoids.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
CS 149: Operating Systems March 3 Class Meeting Department of Computer Science San Jose State University Spring 2015 Instructor: Ron Mak
Memory Management Fundamentals Virtual Memory. Outline Introduction Motivation for virtual memory Paging – general concepts –Principle of locality, demand.
1 Memory Management (b). 2 Paging  Logical address space of a process can be noncontiguous; process is allocated physical memory whenever the latter.
1 Memory Management. 2 Fixed Partitions Legend Free Space 0k 4k 16k 64k 128k Internal fragmentation (cannot be reallocated) Divide memory into n (possible.
Memory Management. Why memory management? n Processes need to be loaded in memory to execute n Multiprogramming n The task of subdividing the user area.
CSC 360, Instructor Kui Wu Memory Management I: Main Memory.
Memory Management Continued Questions answered in this lecture: What is paging? How can segmentation and paging be combined? How can one speed up address.
Chapter 9 Memory Organization. 9.1 Hierarchical Memory Systems Figure 9.1.
Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 33 Paging Read Ch. 9.4.
Main Memory: Paging and Segmentation CSSE 332 Operating Systems Rose-Hulman Institute of Technology.
Virtual Memory (Section 9.3). The Need For Virtual Memory Many computers don’t have enough memory in RAM to accommodate all the programs a user wants.
Basic Paging (1) logical address space of a process can be made noncontiguous; process is allocated physical memory whenever the latter is available. Divide.
Vivek Seshadri 15740/18740 Computer Architecture
Virtual Memory © 2004, D. J. Foreman.
CS 286: Memory Paging and Virtual Memory
Paging and Segmentation
Chapter 8: Main Memory.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy 11/12/2018.
Memory Management 11/17/2018 A. Berrached:CS4315:UHD.
Lecture 27: Virtual Memory
Paging Lecture November 2018.
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 8 11/24/2018.
Background Program must be brought into memory and placed within a process for it to be run. Input queue – collection of processes on the disk that are.
Computer Architecture
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 12/1/2018.
Memory Management-I 1.
Lecture 32 Syed Mansoor Sarwar
Lecture 3: Main Memory.
CSE451 Memory Management Introduction Autumn 2002
So far in memory management…
Chapter 8: Memory Management strategies
Computer System Design Lecture 11
Memory Management Lectures notes from the text supplement by Siberschatz and Galvin Modified by B.Ramamurthy Chapter 9 4/5/2019.
Module IV Memory Organization.
Virtual Memory © 2004, D. J. Foreman.
CSE 542: Operating Systems
CSE 542: Operating Systems
Clock Algorithm Example
Virtual Memory 1 1.
Module IV Memory Organization.
Page Main Memory.
Presentation transcript:

CPSC 457 Operating Systems Lecture 8 Memory Management: Virtual Memory

Last Time Memory Management Midterm Review Address Space Base and Limit Registers How do we store processes Swapping Free Memory Management Midterm Review CPSC 457 - Tyson Kendon 2016

This Time Midterm Virtual Memory Fragmentation Paging Page Tables Translation Look-aside Buffers Page Faults Locality CPSC 457 - Tyson Kendon 2016

Memory Fragmentation External Internal CPSC 457 - Tyson Kendon 2016

Virtual Memory CPSC 457 - Tyson Kendon 2016

Paging Frame Page Page Table Fixed-Sized block of Physical Memory Fixed-Sized block of Logical Memory Page Table Maps the Pages on to the Frames CPSC 457 - Tyson Kendon 2016

Page Address Page Number Page Offset CPSC 457 - Tyson Kendon 2016

Paging can be EXPENSIVE CPSC 457 - Tyson Kendon 2016

Translation Look-aside Buffer Associative High Speed Memory high speed lookup cache CPSC 457 - Tyson Kendon 2016

Big Page Tables Hierarchical Page Tables Hashed / Clustered Paging Lookups for the page table Hashed / Clustered Paging Hash Table entries, possibly gather related pages Inverted Page Table Track all frames and which pages are assigned to them CPSC 457 - Tyson Kendon 2016

Virtual Memory CPSC 457 - Tyson Kendon 2016

How to Implement Virtual Memory Demand Paging Load pages into memory only when you need them Page Fault When you access memory and discover no page CPSC 457 - Tyson Kendon 2016

Next Time Memory Management Page Replacement Algorithms Concurrency How to manage the problems when processes run at the same time Classical problems of Computer Science CPSC 457 - Tyson Kendon 2016

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.