CS 140 Lecture Notes: Demand Paging

Slides:



Advertisements
Similar presentations
CS Introduction to Operating Systems
Advertisements

CS 241 Spring 2007 System Programming 1 Memory Replacement Policies Lecture 32 Klara Nahrstedt.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Lecture 15: Background Information for the VMWare ESX Memory Management.
Princeton University COS 423 Theory of Algorithms Spring 2001 Kevin Wayne Competitive Analysis.
CS 162 Discussion Section Week 7. Recap What is demand paging?
Day 23 Virtual Memory. Operating system’s role in VM Hardware-support Use VM or not Use paging or segmentation or both Software domain Algorithms for.
CS 153 Design of Operating Systems Spring 2015 Lecture 19: Page Replacement and Memory War.
1 Virtual Memory in the Real World Implementing exact LRU Approximating LRU Hardware Support Clock Algorithm Thrashing Cause Working Set.
NCHU System & Network Lab Lab 12 Page Replacement Algorithm.
Programming project #2 1 CS502 Spring 2006 Programming Project #3 Page Replacement Algorithms CS-502 Operating Systems Spring 2006.
CSI 400/500 Operating Systems Spring 2009 Lecture #9 – Paging and Segmentation in Virtual Memory Monday, March 2 nd and Wednesday, March 4 th, 2009.
©UCB CS 161 Ch 7: Memory Hierarchy LECTURE 24 Instructor: L.N. Bhuyan
1 Review for Final Exam Memory management Three central questions File system I/O system Network Protection Security.
Week 7 February 17, 2004 Adrienne Noble. Important Dates Due Monday, Feb 23 Homework 7 Due Wednesday, Feb 25 Project 3 Due Friday, Feb 27 Homework 8.
Memory Management ◦ Operating Systems ◦ CS550. Paging and Segmentation  Non-contiguous memory allocation  Fragmentation is a serious problem with contiguous.
Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.
By Andrew Yee. Virtual Memory Memory Management What is Page Replacement?
Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.
Lecture 11 Page 1 CS 111 Online Virtual Memory A generalization of what demand paging allows A form of memory where the system provides a useful abstraction.
Page Replacement Algorithms and Simulation Neville Allen.
1 Project: Page Replacement Algorithms Lubomir Bic.
Lecture Topics: 11/24 Sharing Pages Demand Paging (and alternative) Page Replacement –optimal algorithm –implementable algorithms.
Memory Management & Virtual Memory © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.
Saket Mengle Paging refers to the process of managing program access to virtual memory pages that do not currently reside in RAM.
Source Page US:official&tbm=isch&tbnid=Mli6kxZ3HfiCRM:&imgrefurl=
CS 140 Lecture Notes: Virtual MachinesSlide 1 Process Abstraction Instruction Set Registers MMU I/O Devices Physical Memory Virtual Memory System Calls.
10.1 Chapter 10: Virtual Memory Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples.
CSCI 6307 Foundation of Systems – Exercise (4) Xiang Lian The University of Texas – Pan American Edinburg, TX
CS422 Principles of Database Systems Buffer Management Chengyu Sun California State University, Los Angeles.
Chapter 9 Memory Organization. 9.1 Hierarchical Memory Systems Figure 9.1.
Путешествуй со мной и узнаешь, где я сегодня побывал.
1.Why we need page replacement? 2.Basic page replacement technique. 3.Different type of page replacement algorithm and their examples.
Virtual Memory Operating Systems 1 Computer Science Dept Va Tech August 2007 © McQuain Page Buffering LRU and the Clock Algorithm are generally.
CS 3204 Operating Systems Godmar Back Lecture 18.
COS 318: Operating Systems Virtual Memory Paging.
Memory Management (2).
Day 22 Virtual Memory.
CSE 120 Principles of Operating
Page 1. Page 2 Page 3 Page 4 Page 5 Page 6 Page 7.
CS 140 Lecture Notes: Virtual Machines
CGS 3763 Operating Systems Concepts Spring 2013
Lecture 39 Syed Mansoor Sarwar
Lecture 40 Syed Mansoor Sarwar
זיכרון וירטואלי Virtual Memory
Demand Paged Virtual Memory
CS 140 Lecture Notes: Virtual Machines
CPSC 457 Operating Systems
Virtual Memory فصل هشتم.
Database Management Systems (CS 564)
CSE 451: Operating Systems Autumn 2003 Lecture 11 Demand Paging and Page Replacement Hank Levy Allen Center
Reminders Homework 4 & project 2 Midterm on Monday, November 8
CS 140 Lecture Notes: Introduction
CSE 451: Operating Systems Winter 2003 Lecture 11 Demand Paging and Page Replacement Hank Levy 412 Sieg Hall 1.
Distributed Systems CS
CS 140 Lecture Notes: Demand Paging
February 12, 2004 Adrienne Noble
Exercise (11).
Today’s agenda High-level memory management (additional materials + Ch10, Module VIII) page replacement algorithms CS354-Fall2018.
CS 140 Lecture Notes: Introduction
Exercise (10).
Jazan University, Jazan KSA
Module IV Memory Organization.
Lecture 9: Caching and Demand-Paged Virtual Memory
CSE 153 Design of Operating Systems Winter 19
CS 140 Lecture Notes: Virtual Machines
Lecture 13: Cache Basics Topics: terminology, cache organization (Sections )
CGS 3763 Operating Systems Concepts Spring 2013
Sarah Diesburg Operating Systems CS 3430
Clock Algorithm Example
Module IV Memory Organization.
Presentation transcript:

CS 140 Lecture Notes: Demand Paging Page Replacement Page Refs A B C D A B E A B C D E A A A A A A E E E E D E B C D B B B B B B A A A A 10 faults FIFO C C C C C C B B B D D D D D D C C A A A A A A A A A A D B C E D B B B B B B B B B B 6 faults MIN C C C C C C C C C D D D E E E E E A A A A A A A A A A A E B B B B B B B B B B B 8 faults LRU C C C C E E E E D D D D D D D D C C C CS 140 Lecture Notes: Demand Paging

More Memory Isn’t Always Better Page Refs A B C D A B E A B C D E A A A D D D E E E E E C D E 9 faults FIFO B B B A A A A A C C C C C B B B B B D A A A A A A E E E E D E B C D B B B B B B A A A A 10 faults FIFO C C C C C C B B B D D D D D D C C CS 140 Lecture Notes: Demand Paging