Exercise (11).

Slides:

Advertisements

Similar presentations

9.4 Page Replacement What if there is no free frame?

Advertisements

Page Replacement Algorithms

Chapter 101 The LRU Policy Replaces the page that has not been referenced for the longest time in the past By the principle of locality, this would be.

Chapter 11 – Virtual Memory Management

§12.4 Static Paging Algorithms

Operating Systems Review.

Virtual Memory Management G. Anuradha Ref:- Galvin.

Virtual Memory. 2 What is virtual memory? Each process has illusion of large address space –2 32 for 32-bit addressing However, physical memory is much.

Chapter 101 Virtual Memory Chapter 10 Sections and plus (Skip:10.3.2, 10.7, rest of 10.8)

CHAPTER 15. QUERY EXECUTIOIN Parin Shah (ID : 207)

Virtual Memory. Names, Virtual Addresses & Physical Addresses Source Program Absolute Module Name Space P i ’s Virtual Address Space P i ’s Virtual Address.

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.

Ecole Polytechnique, Nov 7, Online Job Scheduling Marek Chrobak University of California, Riverside.

03/29/2004CSCI 315 Operating Systems Design1 Page Replacement Algorithms (Virtual Memory)

Minimizing Cache Usage in Paging Alejandro Salinger University of Waterloo Joint work with Alex López-Ortiz.

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.

Slide 12-1 Copyright © 2004 Pearson Education, Inc. Operating Systems: A Modern Perspective, Chapter Virtual Memory.

Maninder Kaur VIRTUAL MEMORY 24-Nov

CSS430 Virtual Memory Textbook Ch9

Memory Management ◦ Operating Systems ◦ CS550. Paging and Segmentation  Non-contiguous memory allocation  Fragmentation is a serious problem with contiguous.

Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.

Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.

Chapter 21 Virtual Memoey: Policies Chien-Chung Shen CIS, UD

Chapter 8 Virtual Memory Operating Systems: Internals and Design Principles Seventh Edition William Stallings.

By Andrew Yee. Virtual Memory Memory Management What is Page Replacement?

CSE 5314 On-line Computation Homework 1 Wook Choi Feb/26/2004.

Virtual Memory. Background Virtual memory is a technique that allows execution of processes that may not be completely in the physical memory. Virtual.

Memory Management What if pgm mem > main mem ?. Memory Management What if pgm mem > main mem ? Overlays – program controlled.

Virtual Memory The memory space of a process is normally divided into blocks that are either pages or segments. Virtual memory management takes.

Page Replacement Algorithms and Simulation Neville Allen.

1 Project: Page Replacement Algorithms Lubomir Bic.

Memory Management & Virtual Memory © Dr. Aiman Hanna Department of Computer Science Concordia University Montreal, Canada.

Homework Assignment #3 J. H. Wang Nov. 13, 2015.

Computer Architecture Foundations for Graduate Level Students.

Virtual Memory The address used by a programmer will be called a virtual address or logical address. An address in main memory is called a physical address.

Problem 3.2 Paging Algorithms-Time & Space Requirements Problem:What are the space and time requirements of LIFO, LFU, and LED? LRU:(least-recently-used):

VIRTUAL MEMORY Virtual Address Space. In computing, virtual address space (abbreviated VAS) is a memory mapping mechanism available in modern operating.

Operating Systems Practical Session 10, Memory Management continues.

NETW3005 Virtual Memory. Reading For this lecture, you should have read Chapter 9 (Sections 1-7). NETW3005 (Operating Systems) Lecture 08 - Virtual Memory2.

CSCI 6307 Foundation of Systems Review: Final Exam Xiang Lian The University of Texas – Pan American Edinburg, TX 78539

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

Chapter 9: Virtual Memory. 9.2 Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Background Virtual memory – separation of user logical memory.

Page Replacement FIFO, LIFO, LRU, NUR, Second chance

1.Why we need page replacement? 2.Basic page replacement technique. 3.Different type of page replacement algorithm and their examples.

Memory Management (2).

Chapter 9: Virtual Memory – Part I

Computer Architecture

Exercise 3.10 Prove Theorem 3.8 R(ALG) >= k(s+1)/(k+s) Solution:

Operating Systems: A Modern Perspective, Chapter 12

Operating Systems: A Modern Perspective, Chapter 12

Lecture 35: Review for Midterm 2

CS241 Section: Week 10.

Memory Management & Virtual Memory

Lecture 39 Syed Mansoor Sarwar

Lecture 40 Syed Mansoor Sarwar

זיכרון וירטואלי Virtual Memory

CS 140 Lecture Notes: Demand Paging

Practical Session 8, Memory Management 2

CS 140 Lecture Notes: Demand Paging

Page Replacement FIFO, LIFO, LRU, NUR, Second chance

CSS430 Virtual Memory Textbook Ch10

Module IV Memory Organization.

Lecture 9: Caching and Demand-Paged Virtual Memory

Chapter 9: Virtual Memory CSS503 Systems Programming

Virtual Memory CSE451 Andrew Whitaker.

Practical Session 9, Memory Management continues

Sarah Diesburg Operating Systems CS 3430

Module IV Memory Organization.

Presentation transcript:

Exercise (11)

Exercise Assume that page size is 10. Please provide the page reference stream for the following sequence of address requests: 9, 10, 23, 34, 25, 1, 56, 44, 29.

Exercise Suppose R= 3, 2, 4, 3, 4, 2, 2, 3, 4, 5, 6, 7, 7, 6, 5, 4, 5, 6, 7, 2, 1 is a page reference stream. Given a page frame allocation of 3, and assuming the primary memory is initially unloaded, how many page faults will the given reference stream incur under: Belady’s optimal algorithm LRU FIFO

Belady’s Algorithm 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4

LRU 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4

FIFO 3 2 4 5 6 7 1 3 3 2 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4 3 2 4