Module IV Memory Organization.

Slides:

Advertisements

Similar presentations

9.4 Page Replacement What if there is no free frame?

Advertisements

Page Replacement Algorithms

Cache and Virtual Memory 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.

Approximating the Optimal Replacement Algorithm Ben Juurlink.

Virtual Memory II Chapter 8.

Scribe for 7 th April 2014 Page Replacement Algorithms Payal Priyadarshini 11CS30023.

Chapter 9 Virtual Memory Bernard Chen 2007 Spring.

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.

Silberschatz, Galvin and Gagne  2002 Modified for CSCI 399, Royden, Operating System Concepts Operating Systems Lecture 38 Frame Allocation Read.

Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Lecture 15: Background Information for the VMWare ESX Memory Management.

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.

03/26/2010CSCI 315 Operating Systems Design1 Virtual Memory Notice: The slides for this lecture have been largely based on those accompanying an earlier.

NCHU System & Network Lab Lab 12 Page Replacement Algorithm.

Memory Problems Prof. Sin-Min Lee Department of Mathematics and Computer Sciences.

1 Lecture 9: Virtual Memory Operating System I Spring 2007.

Memory Management Virtual Memory Page replacement algorithms

CS444/CS544 Operating Systems Virtual Memory 4/06/2007 Prof. Searleman

Memory Management 2 Tanenbaum Ch. 3 Silberschatz Ch. 8,9.

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

Lecture 33: Chapter 5 Today’s topic –Cache Replacement Algorithms –Multi-level Caches –Virtual Memories 1.

Maninder Kaur VIRTUAL MEMORY 24-Nov

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

Operating Systems CMPSC 473 Virtual Memory Management (3) November – Lecture 20 Instructor: Bhuvan Urgaonkar.

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

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

Homework Assignment #3 J. H. Wang Nov. 19, Homework #3 Chap.7: 7.5, 7.10 Chap.8: 8.6, 8.10 Chap.9: 9.3, 9.6 Due: two weeks (Dec. 3, 2009)

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.

Silberschatz, Galvin and Gagne ©2013 Operating System Concepts Essentials – 9 th Edition Chapter 9: Virtual-Memory Management.

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.

Silberschatz, Galvin and Gagne  Operating System Concepts Virtual Memory Virtual memory – separation of user logical memory from physical memory.

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.

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=

10.1 Chapter 10: Virtual Memory Background Demand Paging Process Creation Page Replacement Allocation of Frames Thrashing Operating System Examples.

1 Contents Memory types & memory hierarchy Virtual memory (VM) Page replacement algorithms in case of VM.

Путешествуй со мной и узнаешь, где я сегодня побывал.

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.

COS 318: Operating Systems Virtual Memory Paging.

Memory Management (2).

Computer Architecture

Day 22 Virtual Memory.

Lecture 10: Virtual Memory

Page 1. Page 2 Page 3 Page 4 Page 5 Page 6 Page 7.

CGS 3763 Operating Systems Concepts Spring 2013

Lecture 39 Syed Mansoor Sarwar

What Happens if There is no Free Frame?

Cache Replacement Scheme based on Back Propagation Neural Networks

CPSC 457 Operating Systems

Virtual Memory فصل هشتم.

Суури мэдлэг Basic Knowledge

CS 140 Lecture Notes: Demand Paging

Contents Memory types & memory hierarchy Virtual memory (VM)

CS 140 Lecture Notes: Demand Paging

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

Operating Systems CMPSC 473

Today’s agenda High-level memory management (additional materials + Ch10, Module VIII) page replacement algorithms CS354-Fall2018.

Module IV Memory Organization.

This module covers the following topics.

CGS 3763 Operating Systems Concepts Spring 2013

Clock Algorithm Example

Module IV Memory Organization.

Presentation transcript:

Module IV Memory Organization

Optimal Page Replacement Replace the page that will not be used for the longest period of time. This algorithm is difficult to implement, because it requires future knowledge of page usage. It is mainly used in comparison studies

Optimal Page Replacement Example Consider the reference string : 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 for a memory with three frames.

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1 7

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1 7

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1 7

7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Page Frame Hit -1 7 1 2 3 4 Page Frame Hit 3 2 1 7 Hit Ratio = 11/20 No. of Page Faults = 9