 Just as processes share the CPU, they also share physical memory. This section is about mechanisms for doing that sharing. EXAMPLE OF MEMORY USAGE Calculation.

Slides:



Advertisements
Similar presentations
Mr. D. J. Patel, AITS, Rajkot 1 Operating Systems, by Dhananjay Dhamdhere1 Static and Dynamic Memory Allocation Memory allocation is an aspect of a more.
Advertisements

Operating Systems Lecture Notes Memory Management Matthew Dailey Some material © Silberschatz, Galvin, and Gagne, 2002.
CS 31003: Compilers ANIRUDDHA GUPTA 11CS10004 G2 CLASS DATE : 24/07/2013.
ITEC 352 Lecture 27 Memory(4). Review Questions? Cache control –L1/L2  Main memory example –Formulas for hits.
Chapter 3 Memory Management. 3.1 From Programs To Address Space 3 steps to run the programs of an application – A Compiler translates the source code.
Basic Memory Management 1. Readings r Silbershatz et al: chapters
Assembly Process. Machine Code Generation Assembling a program entails translating the assembly language into binary machine code This requires more than.
CS 311 – Lecture 21 Outline Memory management in UNIX
Day 20 Memory Management. Assumptions A process need not be stored as one contiguous block. The entire process must reside in main memory.
Operating Systems Memory Management (Chapter 9). Overview Provide Services (done) –processes(done) –files(after memory management) Manage Devices –processor.
CS 104 Introduction to Computer Science and Graphics Problems
Operating Systems I Memory Management. Overview F Provide Services –processes  –files  F Manage Devices –processor  –memory  –disk 
Memory Management 2010.
Tanenbaum, Structured Computer Organization, Fifth Edition, (c) 2006 Pearson Education, Inc. All rights reserved The Operating System Machine.
CS 333 Introduction to Operating Systems Class 9 - Memory Management
Memory Management (Ch )
1 Memory Management Virtual Memory Chapter 4. 2 The virtual memory concept In a multiprogramming environment, an entire process does not have to take.
Operating System Concepts
03/05/2008CSCI 315 Operating Systems Design1 Memory Management Notice: The slides for this lecture have been largely based on those accompanying the textbook.
Operating Systems Memory Management (Ch 9). Overview Provide Services (done) –processes(done) –files(done in cs4513) Manage Devices –processor (done)
Operating Systems Memory Management (Ch )
Software Development and Software Loading in Embedded Systems.
Virtual Memory By: Dinouje Fahih. Definition of Virtual Memory Virtual memory is a concept that, allows a computer and its operating system, to use a.
Memory management. Instruction execution cycle Fetch instruction from main memory Decode instruction Fetch operands (if needed0 Execute instruction Store.
Memory Management Ch.8.
Rensselaer Polytechnic Institute CSCI-4210 – Operating Systems David Goldschmidt, Ph.D.
Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?
Computer Architecture and Operating Systems CS 3230: Operating System Section Lecture OS-7 Memory Management (1) Department of Computer Science and Software.
A genda for Today What is memory management Source code to execution Address binding Logical and physical address spaces Dynamic loading, dynamic linking,
CS333 Intro to Operating Systems Jonathan Walpole.
Chapter 8 Memory Management Dr. Yingwu Zhu. Outline Background Basic Concepts Memory Allocation.
8.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts with Java – 8 th Edition Chapter 08 Main Memory (Page table questions)
Rensselaer Polytechnic Institute CSC 432 – Operating Systems David Goldschmidt, Ph.D.
CIS250 OPERATING SYSTEMS Memory Management Since we share memory, we need to manage it Memory manager only sees the address A program counter value indicates.
Memory Management 1 Tanenbaum Ch. 3 Silberschatz Ch. 8,9.
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems Memory: Relocation.
Memory Management Operating Systems CS550. Memory Manager Memory manager - manages allocation and de-allocation of main memory Plays significant impact.
Chapter 91 Logical Address in Paging  Page size always chosen as a power of 2.  Example: if 16 bit addresses are used and page size = 1K, we need 10.
File Systems.  Issues for OS  Organize files  Directories structure  File types based on different accesses  Sequential, indexed sequential, indexed.
Computer Performance. Hard Drive - HDD Stores your files, programs, and information. If it gets full, you can’t save any more. Measured in bytes (KB,
CGS 3763 Operating Systems Concepts Spring 2013 Dan C. Marinescu Office: HEC 304 Office hours: M-Wd 11: :30 AM.
Memory Management memory hierarchy programs exhibit locality of reference - non-uniform reference patterns temporal locality - a program that references.
Object Files & Linking. Object Sections Compiled code store as object files – Linux : ELF : Extensible Linking Format – Windows : PE : Portable Execution.
Chapter 3 Getting Started. Copyright © 2005 Pearson Addison-Wesley. All rights reserved. Objectives To give an overview of the structure of a contemporary.
COMP 3500 Introduction to Operating Systems Paging: Basic Method Dr. Xiao Qin Auburn University Slides.
Introduction to Paging. Readings r 4.3 of the text book.
Displacement (Indexed) Stack
Memory management.
COMBINED PAGING AND SEGMENTATION
Day 19 Memory Management.
Chapter 8 Main Memory.
CS510 Operating System Foundations
Paging Examples Assume a page size of 1K and a 15-bit logical address space. How many pages are in the system?
Data Representation – Instructions
MEMORY MANAGEMENT & their issues
Chapter 8: Main Memory.
Module IV Memory Organization.
Chapter3 Memory Management Techniques
Lecture 32 Syed Mansoor Sarwar
CS399 New Beginnings Jonathan Walpole.
The Operating System Machine Level
Operating Systems Placement Algorithm Alok Kumar Jagadev.
Introduction to the Intel x86’s support for “virtual” memory
Memory Management Tasks
So far in memory management…
The Assembly Language Level
Recursive Page Table Lookup in the x86
Paging Memory Relocation and Fragmentation Paging
Memory Management (Ch 4: )
Presentation transcript:

 Just as processes share the CPU, they also share physical memory. This section is about mechanisms for doing that sharing. EXAMPLE OF MEMORY USAGE Calculation of aneffective address ° Fetch from instruction ° Use index offset

Relocatable Binding o Compiler o linker o loader C=a+b Reserve Memory Area

Object Module Binary Prog.. Source Program Java source program(.java) Class file (.class) Binary file (0,1) Memory allocation, swaping, paging process

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process 6 K.B. Process

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 6 K.B. Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Free space 3 K.B. Process 6 K.B. Process 1 K.B. free 1 K.B. free 2 Mb Process

Process Free space 24 K.B. Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 24 K.B. Free space 24 K.B. Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Process Memory space

Process Free space 12 K.B. Free space 12 K.B. Free space 3 K.B. Free space 3 K.B. Process 6 K.B. Process Free space 24 K.B. Free space 18 K.B. 9 K.B. Free 3 K.B. Process

Process Memory space Process

Frame no Page no

pd f P F P d d=offset Page noFrame no

Page no P=1 Logical & Physical = offset d=3

pd f P F P d d=offset Page noFrame no